Issue and trigger rebalancing in a ranked issue tracking system

ABSTRACT

A computer-implemented method is disclosed. The method comprises calculating a first new rank value in a rank address space for a first issue of a plurality of issues. The rank address space comprises unique, ordered values, and each of the plurality of issues has a rank value in the rank address space. The method further comprises determining whether a length of the first new rank value is greater than or equal to a first rebalancing trigger length. In addition, the method comprises, in response to determining that the length of the first new rank value is greater than or equal to the first rebalancing trigger length, identifying a first delay period that is to elapse before rebalancing the rank address space comprising updating at least one rank value of at least one of the plurality of issues to reduce a possibility of congestion in the rank address space. The method additionally comprises following the first delay period, rebalancing the rank address space.

BENEFIT CLAIM

This application claims the benefit under 35 U.S.C. § 120 as aContinuation of U.S. patent application Ser. No. 14/700,524, filed Apr.30, 2015, which is a Continuation of U.S. patent application Ser. No.14/622,792, filed Feb. 13, 2015, the entire contents of which are herebyincorporated by reference for all purposes as if fully set forth herein.Applicant hereby rescinds any disclaimer of claim scope in the parentapplications or the prosecution history thereof and advises the USPTOthat the claims in this application may be broader than any claim in theparent applications.

COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains materialthat is subject to copyright protection. The copyright owner has noobjection to the facsimile reproduction by anyone of the patent documentor the patent disclosure, as it appears in the Patent and TrademarkOffice patent file or records, but otherwise reserves all copyrightrights whatsoever. Copyright © 2013-2019 Atlassian Pty Ltd.

FIELD OF THE DISCLOSURE

The present disclosure generally relates to issue tracking systems. Thedisclosure relates more specifically to techniques for reordering issuesin an issue tracking system, techniques for balancing issues in an issuetracking system; and techniques for triggering issue balancing in anissue tracking system.

BACKGROUND

The approaches described in this section are approaches that are knownto the inventors and could be pursued. They are not necessarilyapproaches that have been pursued. Therefore, unless otherwiseindicated, it should not be assumed that any of the approaches describedin this section qualify as prior art merely by virtue of their inclusionin this section, or that those approaches are known to a person ofordinary skill in the art.

Issue tracking systems are systems that manage the creation and trackingof issues in a variety of contexts. Issue tracking systems are variouslyreferred to a trouble ticket systems, support ticket systems, requestmanagement systems, and incident ticket systems.

As one example, an issue tracking system may be deployed for use by ahelpdesk. A busy helpdesk may manage thousands, tens of thousands, oreven more issues. Each issue may have a different priority, requiredifferent actions, be handled by different people, and/or be handled bymultiple different people over its lifecycle. An issue tracking systemmay be used to assist in managing and tracking this process. When aproblem is submitted to the helpdesk an issue is created and assigned(at times with a particular priority). As the issue is worked on byvarious users, the progress of the issue is recorded and tracked by theissue tracking system until, ideally, the issue is solved and closed. Atany point during the life of the issue (and/or for historical reviewpurposes) the issue tracking system can be queried to access informationon a given issue, such as its status, the actions that have been taken,who the issue is currently assigned to etc.

An important feature of issue tracking systems is the ability for issuesto be ranked relative to one another. This allows issues to beprioritized at a granular level. Issue ranking is a complex problem forvarious reasons, including: (a) the existence of multiple users, all ofwhom may want to add new issues, assign priorities or re-rank existingissues; (b) automated systems that may also add new issues and/orreorder existing issues; (c) changes to the issues may occur at the sameor substantially the same time; (d) multiple actors may attempt toperform different rank operations on the same (or closely ranked)issues; (e) over time issues may become congested in the sense thattheir rank addresses indicate consecutive ordering without any space fora new issue to be ranked in between.

Some issue tracking systems are implemented in a clustered architecture,typically in order to increase capacity for concurrent users to workwith the system and the issues maintained by the system. In a clusteredarchitecture an issue tacking system is implemented across multiplenodes, each node of the cluster running its own instance of the issuetracking system. While end users see and interact with a single issuetracking system, any given operation may, in fact, be performed by anyof the system nodes. A clustered architecture increases the complexityof issue ranking. For example, in order to effectively implement aranking functionality the issue tracking system should be able to handlemultiple concurrent modifications of the same issue (and closely rankedissues) by different users on different nodes of the cluster without therank order of the issues being corrupted.

SUMMARY

The appended claims may serve as a summary of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings:

FIG. 1 illustrates a single server architecture issue tracking system;

FIG. 2 illustrates a multiple server architecture issue tracking system;

FIG. 3 illustrates one example of a relational database schema;

FIG. 4 illustrates one example of an issue lifecycle;

FIG. 5 is a three part illustration of use of a graphical user interfaceto reorder an issue;

FIG. 6 illustrates a process of performing a rank operation;

FIG. 7 illustrates a process of calculating a new rank value of reducedlength;

FIG. 8 illustrates a process of balancing issues;

FIG. 9 illustrates a process for triggering a balancing process;

FIG. 10 illustrates a process for calculating new rank values andtriggering a balance process; and

FIG. 11 illustrates a computer system with which various embodiments maybe used.

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding of the present invention. It will be apparent, however,that the present invention may be practiced without these specificdetails. In other instances, well-known structures and devices are shownin block diagram form in order to avoid unnecessary obscuring.

This description follows the following outline:

1. Overview

-   -   1.1 Single Server Architecture    -   1.2 Multiple Server Architecture    -   1.3 General Issue Tracking System Operation    -   1.4 Issue Ranks

2. Issue Rank Operations

-   -   2.1 Operational Context and Problem Domains    -   2.2 Implementation    -   2.3 Worked Example    -   2.4 Issue Rank Operation Embodiments

3. Issue Balancing

-   -   3.1 Operational Context and Problem Domains    -   3.2 Implementation    -   3.3 Worked Example    -   3.4 Issue Balancing Embodiments

4. Rebalancing Trigger

-   -   4.1 Operational Context and Problem Domains    -   4.2 Implementation    -   4.3 Worked Example    -   4.4 Balancing Triggering Embodiments

5. Implementation Example—Hardware Overview

1. Overview

In an embodiment, an issue tracking system provides enhanced mechanismsto manage issues.

As used herein, the term “issue tracking system” (which will beshortened to ITS) generally refers to a system which can be used totrack “issues” or, more generally, work items. A work item is an itemwith associated information and an associated workflow—i.e. a series ofstates through which the work item transitions over its lifecycle. Theworkflow for a given work item may be simple (e.g. an open state and aclosed state) or more complex (e.g. open, closed, resolved, in progress,reopened). The particular information and workflow associated with anwork item may vary greatly depending on the scenario in which the ITS isimplemented. By way of example, an ITS may be implemented in a helpdeskscenario, in which case the work items may be issues or tickets loggedwith the helpdesk. An ITS may be implemented in a project managementscenario, in which case the work items may be project tasks. An ITS maybe implemented in a software development scenario, in which case workitems may be bugs, current features under development, and/or featuresintended for further development. An ITS may be implemented in anorganizational administration scenario, in which case work items may beadministrative forms (e.g. leave request forms or the like). Many otherITS implementations in which different work items are tracked throughdifferent lifecycles are possible. The embodiments herein will bedescribed in relation to “issues”. It will be appreciated, however, thatthe embodiments and principles thereof may be applied to different typesof work items.

One embodiment may be implemented as part of an ITS such as JIRA, whichis commercially available from Atlassian Pty Ltd., Sydney, Australia.

An ITS may be provided using a variety of different architectures. Oneimplementation is a client server architecture where the ITSfunctionality is provided by a server computer and accessed by usersfrom client computers. Two examples of a client server implementationare described generally below. Alternative implementations/architecturesare, however, possible. For example, in the case of small enterpriseswith relatively simple requirements, an ITS may be a stand-aloneimplementation (i.e. on a single computer directly accessed/used by theend user).

1.1 Single Server Architecture

FIG. 1 illustrates a single server implementation of an ITS 100 inaccordance with one embodiment. ITS system 100 comprises a servercomputer 102. Server computer 102 hosts an ITS server 104 for providingserver-side functionality of the ITS. The ITS server 104 comprises oneor more application programs, libraries, APIs or other software elementsthat implement the features and functions that are further describedherein. ITS server 104 may include, inter alia, issue rank managementlogic 106, which configures the ITS server 104 to implement issue rankoperations, to initiate issue rank balancing, and/or to implement issuerank balancing as described below.

Server computer 102 also stores or has access to ITS data. ITS datagenerally includes: ITS metadata defining the operation of the ITS (forexample, and as discussed below, issue type definitions, issueworkflows, user permissions and the like); and issue data (i.e. data inrespect of the issues that have been entered into the ITS and are beingmaintained by the ITS). ITS data may, for example, be stored on a localfile system of the server computer 102, a file system of anothercomputer, and/or managed by a database such as database 108. Database108 will typically be provided by database server operating on aseparate physical computer coupled (directly or indirectly via one ormore networks) to ITS server computer 102. Database 108 may however be adatabase server operating on server computer 102 itself.

In this particular embodiment, server computer 102 stores issue indexdata 110 locally, and database 108 stores additional issue data and ITSmetadata. In alternative embodiments a separate index is not providedwith searching being performed on the database 108.

System 100 also comprises a user computer 112. ITS Client computer hostsan ITS client 114 for providing client-side functionality of the ITS100.

The ITS client 108 may be a general web browser application (such as,for example, Chrome, Safari, Internet Explorer, Opera) which accessesthe ITS server 104 via an appropriate uniform resource locator (URL) andcommunicates with the ITS server 104 via general world-wide-webprotocols (e.g. http, https, ftp). The web browser application isconfigured to request, render and display electronic documents thatconform to a markup language such as HTML, XML or extensions, and may becapable of internally executing browser-executable code such asJAVASCRIPT, ACTIVE SERVER PAGES, or other forms of code. Where the ITSclient 114 is a web browser, the ITS server 104 will be a web server(such as, for example, Apache, IIS, nginx, GWS). Alternatively, the ITSclient 114 may be a specific application programmed to communicate withserver 102 using defined application programming interface (API) calls.In this case the ITS server 104 will be a specific application serverconfigured to interact with the ITS client application. A user computer112 may host more than one ITS client 114 (for example a general webbrowser client and a specific application client). Similarly, servercomputer 102 may host more than one ITS server 104.

The ITS server computer 102 may serve multiple user computers 112 (or,more specifically, multiple ITS clients 114). In FIG. 1 three usercomputers have been depicted (112A, 112B, and 112C), though more orfewer could be used.

The server computer 102 and client computer 112 communicate data betweeneach other either directly or indirectly through one or morecommunications networks 116. Communications network 116 may comprise alocal area network (LAN) of an enterprise in one embodiment. In thiscase ITS 100 may be implemented as an on-premises solution in which theserver computer 102 and user computer 106 are associated with the samebusiness enterprise and at least the server computer 102 is within anenterprise-controlled facility that is protected from open internetworksusing firewalls or other security systems. In another embodiment,network 116 may represent a public internetwork and the server computer102 may be located off-premises with respect to an organization, such asin a shared data center or cloud computing facility.

1.2 Multiple Server Architecture

FIG. 2 illustrates a multiple server (clustered) implementation of anITS in accordance with another embodiment. In the arrangement of FIG. 2,the ITS 100 is implemented using one or more server computing instances202 (or nodes) that are instantiated on or hosted in a shared datacenter or cloud computing infrastructure. Examples include AMAZON WEBSERVICES, RACKSPACE, and private cloud data centers. A server computerinstance 202 is instantiated on or hosted in a computer, and in someinstances a single computer may host several server computer instances202. In FIG. 2 two server computing instances 202A and 202B have beendepicted, but there may be any number of server computing instancesinstantiated from time to time based upon the number of ITS clients 114that access the instances, or other performance requirements.

An executable image of each server computing instance 202 includes anITS server 104 with issue rank management logic 106, in a similarfashion to ITS server 104 described above. Each server computinginstance 202 in this embodiment also stores issue index data 110 (alsodescribed above), which during operation of the ITS is replicated acrossall server computing instances. In the arrangement of FIG. 2 all servercomputing instances access a common database 108 to store and retrieveITS data.

From the client side, the multiple server ITS 100 arrangement of FIG. 2is essentially the same as the single server arrangement described withrespect to FIG. 1. User computers 112 host ITS clients 114 whichfacilitate access to the ITS server functionality over network 116. Inthe arrangement of FIG. 2, however, requests from ITS clients 114 areinitially received by a load balancer 204 which distributes requestsbetween the available server computing instances 202. Load balancer 204may be a hardware or software load balancer.

In the arrangement of FIG. 2, network 116 may represent at least oneintemetwork, such as the public internet, in combination with one ormore wired or wireless LANs, WANs, or other network accessinfrastructure such as cable modems, routers, etc.

1.3 General Issue Tracking System Operation

This section describes the general manner in which an ITS such as ITS100 is deployed and used.

ITS 100 maintains ITS metadata defining the operation of the ITS 100. Inone embodiment this metadata includes: one or more issue typedefinitions, each issue type definition defining a field scheme or fieldconfiguration for issues of that type (e.g. the possible fields or datato be maintained by the ITS for issues of a given type); one or moreworkflow definitions, a workflow definition defining the workflow of anissue of a particular issue type (e.g. the states an issue can take andthe manner in which an issue transitions between those states over itslifecycle); and user permissions (e.g. which users may create issues,view issues, amend issues, change the states of issues etc.).

ITS 100 may be configured to store a wide variety of information inrespect of a given issue. By way of one simple example, an issue typedefinition may define the following fields: a project field storing aproject to which the issue belongs; a key field storing a uniqueidentifier for an issue; a description field storing a description ofthe issue and actions taken with respect to the issue; a status fieldindicating the stage the issue is currently at in its lifecycle; anassigned person field indicating who (if anyone) the issue has beenassigned to; a severity field storing the severity of the issue (e.g.critical, major, minor, etc.); a priority field storing the priority ofthe issue at a general level (e.g. very high, high, medium, low, verylow); and a rank field storing a rank value in respect of the issue(defining a rank order of the issue relative to other issues). Issueranking is described in greater detail below. In this example thepriority field and the rank field store different information. A largenumber of issues may have the same priority (e.g. critical), howeveronly one issue may have a given rank value. The actual fields definedwith respect to an issue type will depend on the requirements of a givenITS implementation, and many other fields are possible.

An ITS may maintain issues in a variety of data structures. In oneembodiment issues are stored in a relational database. By way ofillustration, FIG. 3 provides a partial example of a simple relationaldatabase schema 300 for an ITS. In this example, schema 300 includes: anissue table 302 comprising an issue ID field, a project ID field, astatus ID field, an issue description field, and an issue rank field; aprojects table 304 comprising a project ID field and a projectdescription field; a status table 306 comprising a status ID field and astatus description field. Under this partial schema each issue can onlyhave a single issue rank at a given time. In alternative implementationsthe schema is defined so a given issue can concurrently have multipleranks (allowing, for example, different users or user groups to give anissue different ranks).

Schema 300 has been provided for descriptive purposes, however arelational database schema for an ITS will typically be considerablymore complex and have additional/different tables withadditional/alternative fields and linked in alternative ways.Furthermore, different data structures entirely could, in some cases, beused. For example, issues could be stored in a single table datastructure (which may be appropriate for relatively simple ITSs) wherethe single table stores all relevant issue data. Table 1 provides anexample of a simple single table data structure for storing issues:

TABLE 1 Key Project ID Description Status Priority Rank . . . . . .

The workflow associated with a given issue will also depend on thespecific requirements of the ITS implementation. By way of a simpleexample, FIG. 4 depicts a lifecycle 400 that could be used in a helpdeskimplementation. In lifecycle 400 an issue may take (and transitionbetween): an open state 402; an in progress state 404; a resolved state406; a closed state 408; and a reopened state 410. Different lifecycleswith different states and/or transitions between states will beappropriate for different implementations.

In order to create and progress issues in ITS 100 users interact withappropriate user interfaces provided by an ITS client 114. For example,a user may create a new issue and provide relevant information inrespect of the issue (e.g. a particular project the issue is associatedwith, a description, a priority, any other relevant information cateredfor). The ITS 100 itself will typically generate a key that can be usedto uniquely identify the issue, which may be hidden from or visible tothe user. Once an issue has been created a user can interact with it,for example by adding additional information to the issue (e.g. in anissue description or other field), changing the state of the issue (e.g.from in progress to resolved), assigning the issue to another person(e.g. by changing an assigned person field).

1.4 Issue Ranks

As mentioned above, an issue rank value defines the order of an issuewith respect to other issues. An issue ranking scheme defines themaximum allowed rank length, what values are available to be assigned toeach rank character, and how rank values are ordered. The set ofavailable rank values will be referred to as the rank address space, andis defined by the maximum allowed rank length (i.e. the total number ofcharacters a rank value may include) and the allowed values for each ofthose characters. The order of the rank values is defined by an orderingsystem. Actual issue ranks are unique values allowing for the rank orderof all issues (or of a subset/collection of the existing issues) to beestablished. Further, the ITS may be configured so that each issue canbe assigned multiple rank values to allow for different orderingschemes. This may be appropriate, for example, where one user or groupof users wishes to rank the issues tracked by the ITS differently toanother user or group of users.

By way of illustration, issue ranking scheme may define a maximumallowed rank length of four characters, and that the allowed value foreach character are is a whole number 0 to 9. This defines that issuerank values are whole numbers from 0000 to 9999 (endpoints inclusive),and gives an address space size of 10,000. In this case an appropriateordering system could be ascending numerical order—i.e. an issue with arank value of 0000 being ranked before an issue with a rank value of0001, an issue with a rank value of 0001 being ranked before an issuewith a rank value 0002 and so forth. Numerical

Various issue ranking schemes are possible. For example, different issueranking schemes may be defined by varying the maximum allowed ranklength and/or the values a given character may take (e.g. numbers,letters, and/or symbols). Similarly, various ordering systems may beimplemented—numerical ordering (which can be applied to numbers andletters—e.g. where hexadecimal is used), lexicographical ordering, orcustom defined ordering systems. Applying different ordering systemswill impact the ordering of the rank values. For example, in a numericalordering system a rank value of “6” will rank before a rank value of“20”. In a lexicographical ordering system, however, a rank value of“20” will rank before a rank value of “6” (though not before a rankvalue of “06”). In some instances the maximum rank length may be limitedby the maximum field size of the data structure being used to storeissues—for example some databases may impose a 255 byte (character)limit to an index field. In this case characters that are not necessaryfor the rank value may be dealt with trailing null characters orexplicit leading zeroes. For example, a rank value of “AB” in a 6character fixed width field could be stored as “ABØØØØ” (or “ØØØØAB”) or“ØØØØAB”.

In one particular embodiment, an issue ranking scheme defines a maximumallowed rank length of 253 characters, and that each of the 253characters is capable of being an alphanumeric character—i.e. any of 0to 9 or A to Z. In this case each character may take any one of 36values, providing a rank address space with 36 to the power of 253unique ranks (and therefore capable of definitively ordering 36 to thepower of 253 issues). In this embodiment a lexicographical orderingsystem is used to determine the order of the ranks. A lexicographicalordering scheme may be advantageous where the ITS 100 allows for fulltext indexing and searching of issue data (for example by using ApacheLucene), as in this case alphanumeric issue ranks can be treated as anyother text field.

In certain embodiments the rank length of a particular issue's rankvalue is relevant. In one embodiment issue ranks are stored in avariable character (varchar) field. In this case an issue's rank lengthis simply the number of characters in the issue rank. For example a rankvalue of “AA” has a rank length of two, a rank value of “AAAAAAAA” has arank length of eight.

In other embodiments issue ranks may be stored in a fixed size field. Inthis case each issue will have the number of characters defined by thesize of the fixed size field (which also defines the maximum allowedrank length), irrespective of how many of the characters are actuallyneeded. In this case characters not needed to define the rank may beassigned a special value (e.g. a null character, indicated herein as Ø).In this case the length of an issue rank value is the number of “normal”(e.g. non-special characters) in the rank value. This can be calculatedin a variety of ways. For example, if trailing special characters areused the length of a rank value can be determined with reference to theindex position of the last non-special character. E.g., in “ABØØØØ” theindex position of the last non-special character (“B”) is 2 (the indexstarting from 1), and the length of the rank value is 2. Alternatively,in “ABBCØØ” the index position of the last non-special character (“C”)is 4 and the length of the rank value is 4. If leading specialcharacters are used the index position of the last non-special charactercan again be used to calculate the length of a rank value, though inthis case with reference to the size of the field. E.g., in “ØØØØAB” theindex position of the first non-special character (“A”) is 4 (the indexin this case starting from 0), and the length of the rank value is thesize of the field (6) take this index position: 6−4=2. Alternatively, in“ØØABBC” the index position of the first non-special character is 2 andthe length of the rank value is (6−2)=4.

In alternative embodiments, instead of using special symbols such asnull characters, rank values may be “packed” with leading charactersthat take the lowest possible character value. By way of example, if aranking scheme defines that characters may take the values A-Z (and alexicographical ordering system is used), the character ‘A’ is thelowest possible character value. Alternatively, if a ranking schemedefines that characters may take the values 0-9 (and an ascendingnumerical ordering system is used), the character ‘0’ is the lowestpossible character value. In this case, a field of 6 characters storinga rank of “102” would be stored as “000102” and a rank of “50” would bestored as “000050”. In this case an issue's rank length is determinedwith reference to the index of the first character that takes a valueother than the lowest possible character value defined by the rankingscheme. For example, rank length may be calculated by subtracting theindex of the first character taking a value other than the lowestpossible character value from the size of the fixed length field (theindex of a character being counted from zero). Presuming the lowestvalue a character can take is ‘0’, in a six character fixed size field arank value of “000105” has a rank length of three (the numeral 1 beingthe first character taking a non-zero value and being in index position3); a rank value of “000009” has rank length of one (the numeral 9 beingin index position 5); a rank value of “010012” has a rank length of five(the first 1 in the value being in index position 1); a rank value of“310012” has a rank length of five (the number 3 being in index position0).

Various ranking schemes are used for descriptive purposes herein. Theseranking schemes have been selected in order to illustrate relevantfeatures. It will be appreciated, however, that the features describedcan be applied to alternative ranking schemes with alternative (andtypically significantly larger) maximum allowed rank lengths, differentallowed character values, and/or different ordering systems.

When an issue is created in the ITS 100 it is assigned a rank value.Over the lifecycle of an issue its rank may be changed many times—eitherin response to a user reordering request (e.g. to increase or decreasethe importance of an issue relative to other issues), or as a result ofthe ITS server 104 performing rank management operations (e.g. balancingissue ranks as described below). A rank operation may be initiated by auser request, for example where the user requests that an issue bereordered. In this case a user may change the issue rank value manually,for example by accessing the rank field of the issue and entering adesired value.

Alternatively, a user initiated rank operation may be the result of auser interacting with a graphical user interface provided on a usercomputer 112 by the ITS client 114. An example of such a user interfaceis depicted in FIG. 5. The user interface graphically depicts fiveissues, respectively identified by the numbers 1 to 5—on a displayscreen 502 of the user computer 112. In this example numbers 1 to 5 aresimply issue identifiers (e.g. an issue name or key or the like) and donot indicate the rank of the issue which is defined by an issue rankfield. Each issue is displayed with additional information—in this case,and by way of example only, a description of the issue, an assignee ofthe issue, and the priority of the issue. Although the rank values ofthe issues are depicted in FIG. 5, this need not be the case—and oftenactual rank values will not be displayed (particularly where they arelarge values that are not particularly readable to a user). The issuesare displayed so that a user can tell their order intuitively withoutreference to the specific rank value—in this case the issues aredisplayed in rank order from top to bottom—i.e. in screen 504 Issue 1 isabove and ranked before Issue 2, Issue 2 is above and ranked beforeIssue 3 etc. During interaction with the ITS 100 a user may wish toreorder an issue. For example a user may wish to rank Issue 4 betweenIssue 1 and Issue 2. To do so the user manipulates Issue 4, for exampleby dragging and dropping Issue 4 into the desired order (e.g. byinteraction with a touch screen display, by use of a mouse or otherpointing device, or by keyboard commands). Screen 506 depicts a point intime in the user interface where the user has selected Issue 4 andstarted moving it, and screen 508 shows the completed operation. Inscreen 508 the user can now visually see that Issue 4 has been rankedafter Issue 1 and before Issue 2. In the background, and as described infurther detail below, the ITS server has performed a rank operation toadjust the rank of at least Issue 4 in order to reflect the changedorder of the issues. In this particular case Issue 4 has been given arank value of AAJ, which sits between the rank value of Issue 1 (“AAA”)and the rank value of Issue 2 (“BBB”).

This specification will describe two general types of rank operations inwhich the rank value of an issue is (or may be) changed: reordering rankoperations and balancing rank operations.

In a reordering rank operation a request is made to change the order ofan issue so that it ranks after an issue it is currently ranked before,or so that it ranks before an issue it is currently ranked after. Asuccessful reordering rank operation will change the order of the issuesrelative to one another.

In a balancing operation the rank value of an issue is changed, but itsorder relative to other issues remains the same. After a rebalancingoperation the issue is ranked before all issues it was ranked beforeprior to the rebalancing operation and is ranked after all issues it wasranked after prior to the rebalancing operation.

2. Issue Rank Operations

2.1 Operational Context and Problem Domains

In various embodiments, the techniques herein address several problemsthat the inventors have identified in the conventional operation ofITSs. As one example, while allowing multiple users (via multiple ITSclients 114) to interact with the ITS at the same time is desirable,doing so can cause unintended consequences, particularly where multiplerank operations are performed on issues with the same or close rankvalues at the same (or approximate same) time.

For example, a current state of the ITS 100 may include four issues asshown in Table 2 (presuming a maximum allowed rank length of threealphanumeric characters and a lexicographical ordering scheme). Notethat while numeric values have been used as issue identifiers these aremerely identifiers and do not indicate any order of the issues (which isdefined by the issue rank field).

TABLE 2 Issue identifier Issue Rank 1 AAA 2 BBB 3 CCC 4 DDD

One user submits a first request to reorder issue 1 immediately beforeissue 4. At around the same time another user (via another ITS client114) submits a second request to reorder issue 4 immediately after issue1.

The ITS server 104 receives the first request and launches a firstthread to perform the requested operation. The first thread reads therank values of issue 4 (“DDD”) and the issue ranked before issue 4(issue 3, “CCC”).

The ITS server 104 then receives the second request and launches asecond thread to perform the requested operation. The first thread isinterrupted and the second thread performs its rank operation. Thesecond thread reads the rank values of issue 1 (“AAA”) and the issuethat is ranked after it (issue 2, “BBB”). Based on these rank valuesthread 2 determines a new rank value for issue 4—e.g. “ABC” (being arank value between “AAA” and “BBB”) and writes the new rank value.Following this operation the state of the ITS is as shown in Table 3:

TABLE 3 Issue identifier Issue Rank 1 AAA 4 ABC 2 BBB 3 CCC

With the second thread finished, the first thread resumes where it leftoff. Recall that the first thread has read the rank values of issues 4and 3 as “DDD” and “CCC” respectively, despite the fact that the rankvalue of issue 4 has subsequently been altered by the second thread.Based on these rank values the first thread determines a new rank valuefor issue 1: “CCD” (being a rank value between “CCC” and “DDD”).Following this operation the state of the ITS is as shown in Table 4:

TABLE 4 Issue identifier Issue Rank 4 ABC 2 BBB 3 CCC 1 CCD

As can be seen, the actual order at the end of the two user requests is:issue 4, issue 2, issue 3, issue 1. The two requests have interferedwith each other and as a consequence neither user request has beensatisfied: issue 1 is not ranked before issue 4 as requested by thefirst user, and issue 4 is not ranked after issue 1 as requested by thesecond user.

As this example illustrates, there is a need for techniques that improvethe ability to reorder issues in an ITS to prevent, or at least reduce,unintended consequences. This is particularly the case in a clusteredarchitecture as described above, where multiple ITS servers 104 may beindependently receiving and processing reordering operations in respectof the same issues from multiple ITS clients 114.

2.2 Implementation

In one embodiment, in order to facilitate ranking operations a lockmechanism is implemented. The lock mechanism prevents rank operationsfrom manipulating rank values of issues that are relevant to other rankoperations. In this context a rank operation is an operation thatinvolves the alteration of an issue rank. A rank operation may involvereordering of issues relative to one another (e.g. by the rank of anissue being changed so the issue ranks before or after another issue),but need not. For example in the in the balancing of issues describedbelow the rank of an issue is changed without impacting its orderrelative to other issues. A rank operation may be initiated on receivinga user request to change the order of an issue, or may be automaticallyinitiated by an ITS server 104 itself.

Given the various architectures that the ITS may be deployed in, thelock mechanism described herein is designed to work in a single serveror clustered (multi-server) environment. In a clustered environment thedatabase 108 provides a synchronization point. Some databases providenative functionality for locking records/preventing conflictingoperations. Even if such native functionality could be invoked toprovide a viable solution to the problem described above, a problemstill exists if the ITS 100 is deployed for use with a differentdatabase having different native functionalities. Even if one type ofdatabase does have useful native functionality, another database thatthe ITS 100 is to be used with may not (or may, but implement it in adifferent way). Accordingly, the techniques described herein aredatabase agnostic, in that they do not rely on any particular nativedatabase locking/conflict management functionality.

In order to avoid the issue reordering problems described above, oneembodiment involves the creation of lock information fields for storinglock information associated with an issue. Where a rank operation is tobe performed (for example by reordering an issue) the operation willattempt to acquire a lock. If the lock cannot be acquired (due toanother operation having acquired a lock) the rank operation will not beable to proceed.

In one embodiment the lock information fields include a lock value fieldand a lock time field. The lock information fields may be associatedwith an issue in any appropriate manner. For example, and continuingwith the simple database schema 300 described above, the lockinformation fields may be defined in the table storing issue rankinformation (ITS Rank table 312 in this case). An example tablestructure is depicted in Table 5. The lock information fields could bestored in other tables and/or related to a particular issue inalternative ways.

TABLE 5 Issue_ID Rank_Value Lock_Value Lock_Time

The lock value field stores a value indicating when the issue (asidentified by the issue ID) is locked. This occurs when a rank operationis in progress. The lock time field stores a time value allowing thetime since the lock was acquired to be determined and/or the time atwhich the lock placed on the issue expires in the event the lock is notreleased by the thread or process that initially locked it.

FIG. 6 illustrates a process 600 of performing a rank operation.

At 602 a rank operation is initiated by the ITS server 104. A rankoperation may be initiated on receiving a request from a user to changethe rank of an issue, or may by initiated by an ITS server 104 itself.

At 604 a maximum operation runtime for the rank operation is determined.The maximum operation runtime value defines the maximum allowed runtimefor the rank operation, and is checked (at 614) any time the rankoperation cannot proceed. By way of one example, a suitable maximumoperation runtime may be set as 5 seconds.

At 606 the process determines the relevant issues to the rank operation.The relevant issues to the rank operation depend on the type of rankoperation being performed. In one embodiment, the types of rankoperations include reordering rank operations, a rank deletionoperation, and rebalancing operations. A reordering operation arisesfrom a request to change the order of the issues—for example to rank anissue first, to rank an issue immediately before another issue, to rankan issue immediately after another issue, to rank an issue last. A rankdeletion operation arises from a request to delete an issue and itsrank. A balancing operation arises from a request to balance an issue bychanging the rank value without changing the order of the issues (issuebalancing is discussed in detail in Section 3 below).

In order to facilitate certain rank operations, minimum and maximummarker records can be created in the data structure. The minimum markerrecord stores a minimum (i.e. first) rank value that can be used (e.g.000). The maximum marker record stores a maximum (i.e. last) rank valuethat can be used (e.g. ZZZ). In one embodiment the minimum and maximummarker records are stored as “dummy” issues, for example issues 5 and 6shown in table 6. In the example shown in table 6 the minimum andmaximum marker records are given issue identifiers of −1 and −2respectively to distinguish them from “normal” issues (with IDsof >=zero) and protect them from unintended ranking operations. Inaddition, or alternative, protection of the minimum and maximum markersmay be achieved by an “issue type” field—for example type 1=normalissue, type 2=minimum marker issue, type 3=maximum marker issue.

TABLE 6 Issue_ID Issue_Rank Lock_Value Lock_Time −1 000 −2 ZZZ

In one embodiment, different reordering rank operations include: a rankfirst operation; a rank last operation; a rank before operation; and arank after operation. Alternative reordering rank operations arepossible. The relevant issues for a reordering rank operation are thesubject issue (i.e. the issue whose order and rank value is actuallybeing changed), and the two issues which the subject issue is intendedto be ordered between in order to complete the reordering operation. Thetwo issues which the subject issue is intended to be ordered betweenwill be referred to as neighbor issues, and specifically a lower rankedneighbor (i.e. the neighbor issue with the lower rank value to thesubject issue) and a higher ranked neighbor (i.e. the neighbor issuewith the higher rank value to the subject issue). In some cases adetermination may be made that the subject issue is one of its ownneighbors. For example, an issue will be its own higher ranked neighborif a request is made to rank an issue after a particular issue and theissue is already the next highest ranked issue to the particular issue.Similarly, an issue will be its own lower ranked neighbor if a requestis made to rank a subject issue before a particular issue and thesubject issue is already ordered immediately before the particular issue(i.e. has the next lowest rank to the particular issue). In this casethe process determines that the subject issue is already in the correctorder.

The rank first operation is performed when a reorder request is made torank a subject issue first. The rank first operation ranks an issuebefore all existing real issues (i.e. before all issues except theminimum marker issue) maintained by the ITS 100. The relevant issues fora rank first operation, therefore, are the subject issue, the minimummarker issue (being the lower ranked neighbor) and the issue currentlyranked first (being the higher ranked neighbor). Ranking an issue firstmay, for example, be achieved by subtracting a constant number from therank value of the first real issue (provided this yields a rank in therank address space). As an alternative example, ranking an issue firstmay involve calculating and assigning the rank halfway (or approximatelyhalf way) between the rank of the first actual issue and the minimummarker row.

The rank last operation is performed when a reorder request is made torank a subject issue last. The rank last operation ranks an issue afterall the existing real issues (i.e. after all issues except the maximummarker issue) maintained by the ITS 100. The relevant issues for a ranklast operation, therefore, are the subject issue, the maximum markerissue (being the higher ranked neighbor) and the issue currently rankedlast (being the lower ranked neighbor). Ranking an issue last may, forexample, be achieved by adding a constant number from the rank value ofthe last real issue (provided this yields a rank in the rank addressspace). As an alternative example, ranking an issue last may involvecalculating and assigning the rank halfway (or approximately half way)between the rank of the last actual issue and the maximum marker row.

When a new issue is created without a specific rank/order beingspecified the rank last operation may be invoked in order to provide theissue with an initial rank value and position in the order. If a newissue is the very first issue created and added to the ITS it may beranked halfway between the ranks of the minimum and maximum makers.

The rank before operation is performed when a reorder request is made torank a subject issue before a specified issue. The rank before operationranks the subject issue immediately before the specified issue (i.e.between the specified issue and issue with the next lowest rank value).The relevant issues for a rank before operation, therefore, are thesubject issue, the specified issue (being the higher ranked neighbor),and the issue with the next lowest rank value to the specified issue(being the lower ranked neighbor). If the specified issue is the lowestranked real issue (i.e. the lowest tanked issue excepting the minimummarker issue), the issue with the next lowest rank will be the minimummarker issue.

The rank after operation is performed when a reorder request is made torank a subject issue after a specified issue. The rank after operationranks the subject issue immediately after the specified issue (i.e.between the specified issue and issue with the next highest rank value).The relevant issues for a rank after operation, therefore, are thesubject issue, the specified issue (being the lower ranked neighbor),and the issue with the next highest rank value to the specified issue(being the higher ranked neighbor). If the specified issue is thehighest ranked real issue (i.e. the highest tanked issue excepting themaximum marker issue), the issue with the next highest rank will be themaximum marker issue.

The delete rank operation is performed when an issue is to be deleted(in which case its rank value is also deleted). In a delete rankoperation there is no need to determine higher/lower ranked neighborissues—the only relevant issue being the subject issue actually beingdeleted.

Balancing issues is described in more detail in Section 3 below. In oneembodiment balancing rank operations include: a start balance upoperation, a start balance down operation, a balance issue up operation,and a balance issue down operation.

A start balance up rank operation is performed to commence a balance upprocess. The relevant issue for a start balance up operation is themaximum marker.

A start balance down rank operation is performed to commence a balancedown process. The relevant issue for a start balance down operation isthe minimum marker.

A balance issue up rank operation is performed to balance issues duringa balance up process. The relevant issues for a balance issue up rankoperation are the subject issue being balanced up and a higher rankedneighbor.

A balance issue down rank operation is performed to balance issuesduring a balance down process. The relevant issues for a balance issuedown rank operation are the subject issue being balanced down and alower ranked neighbor.

Returning now to FIG. 6, at 608 the process reads data in respect of therelevant issues identified at 606. The data read includes, for eachrelevant issue, the issue ID, the issue rank value, and the lock value(if any).

At 610 the process determines whether the data in respect of therelevant issues is as expected. The expected data is dependent on thenature of the rank operation being performed. For example, for areordering operation it will be expected that: the subject issue is notthe same issue as either of the neighbor issues; that there is at leastone available rank between the ranks of the neighbors (i.e. that thereis space for the issue to be ranked in the desired order); and that noneof the relevant issues is locked with a current lock (i.e. a lock thathas not expired). Expected issue data for balancing rank operations isdescribed in section 3 below.

At 612, in response to the relevant issue data not being as expected,the process determines if the requested rank operation should bepossible. By way of example, a reordering rank operation will not bepossible if the process determines that the issues are already in therequested order. This will be the case if the subject issue ID is thesame as the issue ID of either of the determined neighbor issues. Areordering rank operation will also not be possible if there is no rankvalue available that will result in the issues being ordered asrequested. This will be the case if the determined neighbor issues holdimmediately adjacent rank values (i.e. without any intervening rankvalues) in the issue rank scheme.

At 614, in response to determining that the operation should bepossible, the process determines whether the actual runtime of theoperation is less than the maximum operation runtime determined at 604.In response to determining that the actual runtime is less than themaximum operation runtime, the operation returns to 606 and reattemptsperformance of the rank operation.

At 616, in response to determining that the actual runtime is greaterthan or equal to the maximum operation runtime, an output message isgenerated and returned to the user or process that initiated the rankoperation. The output message may return information on the error—i.e.that the maximum runtime was exceeded. The rank operation then ends.

An output message is also generated and returned at 616 in response todetermining that the rank operation is not possible (at 612). The outputmessage may simply indicate an error, or may define the nature of theerror (e.g. issues in correct order, ranks too congested). In oneembodiment, if a rank operation is not possible due to there being noavailable rank value that will result in the issues being ordered asrequested, a balancing process is commenced without delay—for example asdescribed in Section 3 below.

At 618, in response to determining that the relevant issue data is asexpected at 610, the process attempts to acquire locks on each of theissues identified as being relevant to the rank operation. In oneembodiment, attempting to acquire a lock on an issue involvesdetermining whether the lock value of the issue indicates the issue tobe locked or unlocked. If the lock value for a given issue does notindicate the issue is locked, the process generates a lock value andwrites this to the issue. Conversely, if the lock value indicates theissue is locked then the process cannot acquire a lock on that issue. Anissue may be found to be locked at 618 if, for example, between checkingthe relevant issue data at 610 and attempting to acquire a lock at 618another process has acquired locks on one or more of the relevantissues.

In one embodiment, the lock value field may simply store a flag—e.g. avalue of 1 indicating the issue is locked, and a value of 0 (or NULL)indicating the issue is not locked.

In another embodiment, the lock value that indicates an issue is lockedis an identifier, such as a unique identifier or a universally uniqueidentifier (UUID). A unique identifier or UUID may be randomly generatedby the ITS server 104 as required. Using a UUID or similar has theadvantage that in the event that a lock cannot be acquired on allrelevant issues, any locks that are acquired can be easily rolled back.For example, if the three relevant issues with issue identifiers 42, 47,and 49 have been identified and the UUID of qw347 has been generated,SQL statement 1 below may be used to try and acquire locks on therelevant issues in a single lock acquisition request:

SQL Statement 1 UPDATE ITS_TABLE SET LOCK_VALUE = ‘qw347’ WHERE ISSUE_IDIN (42, 47, 49)  AND LOCK_VALUE IS NULL

In one embodiment, when a lock is acquired on an issue a lock time valueis written to the lock time field. The lock time value is used to ensurethat an issue does not remain locked indefinitely (or for an unduelength of time), which could impact on the completion of other rankoperations. This may be achieved in a number of ways. For example, thelock time value may be a timeout period which decays and, on reachingzero, the lock is released. Alternatively, the lock time value may beset to be a specific time that is a defined time period after a currentsystem time, and when that time is reached the lock is released. Themaximum period of time for which a lock can be maintained can be set asdesired. By way of example a period of 30 seconds may be appropriate.

At 620 the process determines whether the lock acquisition operation wassuccessful. In order to be successful, locks must have been acquired onall relevant issues, for example by writing new lock values to thoseissues. The lock acquisition will not be successful if any relevantissues were not successfully locked. Where the lock acquisition attemptis made by SQL statement 1 above (or a similar statement), the SQLstatement returns a count of the number of rows that are updated. If thereturned count is less than the number of relevant issues to the rankoperation, the lock acquisition has not been successful. Conversely, ifthe returned count is equal to the number of relevant issues the lockacquisition has been successful. For example, reordering operations havethree relevant issues (the subject issue and two neighbors). As such areturned count of three indicates all required locks have beensuccessfully acquired, and the lock acquisition operation is successful.A return count of less than three indicates that at least one requiredlock was not been acquired and the lock acquisition operation is notsuccessful.

At 622, in response to determining that the lock acquisition (on allrelevant issues) was not successful, the process releases any locks thatwere acquired. For example, if the returned count for a reorderingoperation was 2 it would indicate that two of the relevant issues werelocked, but one was not. The return value of 2 does not, however,provide information on which lock(s) weren't acquired. A consequence ofthis is that the operation cannot proceed (as not all relevant issueshave been locked), but that it has locked two issues which could impededother rank operations.

If a simple flag value was used as the lock value (e.g. 1=locked,0/NULL=unlocked) it would not be possible to determine which issues hadbeen locked as a consequence of a single lock acquisition request suchas the SQL statement 1 above, and which issues had been locked byanother rank operation. By using an identifier as the lock value,however, determining which issues have been locked by the instant rankoperation (and releasing those issues) is simple. For example, SQLstatement 2 below could be used to release all relevant locks—those withthe relevant lock value identifier—in a single lock release request:

SQL Statement 2 UPDATE ITS_TABLE SET LOCK_VALUE = NULL WHERE LOCK_VALUE= ‘qw347’

In an alternative embodiment, attempting to acquire locks on therelevant issues involves initiating a separate lock acquisitionoperation for each relevant issue. In this case each individual lockoperation is recorded as being successful or unsuccessful, and if any ofthe lock operations fail locks that were acquired can be rolledback/unlocked. In some cases, however, using separate operations toacquire the required locks is less efficient than doing so in a singleoperation. Furthermore, using separate operations increases thelikelihood that between the successive lock operations locks on desiredrecords will be acquired by other processes, and therefore thelikelihood that the rank operation will not be able to proceed.

After releasing any acquired locks at 622, the process implements adelay at 624. The delay is to allow other operations to complete and, ifnecessary, issues locked by other processes to be unlocked before tryingto perform the rank operation again. In one embodiment the perioddelayed at 624 is calculated based on how many times the rank operationhas been forced to delay. The first time a rank operation is forced todelay the delay is introduced by performing a no-op instruction. Thesecond time the same rank operation is forced to delay an instruction isexecuted to allow for other threads/processes to complete (for exampleby calling Thread yield in a JVM implementation). The third (and anysubsequent) time the same rank operation is forced to delay the threadcontrolling the rank operation is put to sleep for a calculated periodof time. In one embodiment the sleep period is calculated to be (inmilliseconds): (numberOfDelays*50)+random(numberOfDelays*50). A randomelement is introduced to prevent rank operations backing off in lockstepwith each other. Alternative delay mechanisms could be used—for exampleby defining a static delay period or implementing an alternative delayalgorithm (such as an exponential back-off algorithm).

Following the delay at 624 the process returns to 616 to check thecurrent runtime has not exceeded the maximum allowable runtime.

At 626, in response to determining the lock acquisition operation issuccessful, the process re-reads the data in respect of the relevantissues.

At 628, the process re-determines whether the data in respect of therelevant issues is as expected. This is to protect against any variationthat may have occurred between the check at 610 and the lock acquisitionat 620. Any variation between the data read at 608 and the data read at626 will indicate that the data is not as expected. This check isperformed to determine whether any other user/process reordered relevantissues prior to acquiring an exclusive lock on those issues.

In response to determining that the data is not as expected at 628, theprocess at 630 releases locks that were successfully acquired (at 620)and aborts. In this case a “concurrent modification error” or similarmessage may be generated at 616.

At 632, in response to determining that the data is as expected, theprocess calculates the new rank value for the issue. The calculation ofnew rank values is described further below.

At 634, the new rank value is associated with the subject issue—forexample by being written to the rank value field of the row associatedwith the issue ID of the subject issue.

At 636 the process releases the acquired locks, for example by using astatement such as SQL Statement 2 above. The process also clears (setsto NULL) the lock time values of the relevant issues.

Following the release of the acquired locks the process generates anoutput message at 616 indicating the rank operation has been successfuland ends.

Performing rank operations by the process described above preventsmultiple rank operations from interfering with one another. This isachieved without requiring the entire database (or rank table) to belocked, and as such multiple non-colliding rank operations can beperformed at the same (or substantially the same) time. Non-collidingrank operations in this sense are rank operations that do not involvethe same relevant issues. Furthermore, the process provides cluster-safelocking without requiring extra configuration or node-discovery, and isimmune to network partitions as it does not require network connectivitybetween ITS server nodes.

Calculation of New Rank Values: Reordering Rank Operations

A variety of techniques may be used to calculate the new rank value in areordering operation. The particular calculation/technique used maydepend on the type of rank operation being performed.

For reordering rank operations a new rank value is calculated bydetermining a new rank value falling between the rank value of the lowerranked neighbor and the rank value of the higher ranked neighbor. In oneembodiment a new rank value is calculated by: reading the rank values ofthe higher and lower ranked neighbors; converting these rank values tonumeric rank values (if necessary); calculating a new numeric rank valueas: floor((numeric rank of lower ranked neighbor+numeric rank value ofhigher ranked neighbor)/2)) [the ceiling could alternatively be used];and converting the new numeric rank value back to an actual rank value(if necessary). Conversion to numeric rank values may be necessary wherea rank value includes symbols or letters. Determining the new rank valueto be the rounded midpoint between the rank values of the neighbor ranksresults in the new rank value having the maximum distance from bothneighbors (distance in this sense referring to the number of rank valuesbetween two given rank values).

In one embodiment, new rank values are calculated with a view toreducing the length of the new rank values. This is generally achievedby calculating new rank values to pack out the higher significancecharacters before resorting to characters of lower significance. FIG. 7illustrates an example process 700 for minimizing or reducing the lengthof a new rank value.

At 702 the process calculates an initial rank value for subject issue.In this embodiment this calculation is: floor((numeric rank of lowerranked neighbor+numeric rank value of higher ranked neighbor)/2)).

At 704 the process initializes a significant character index i to one(i=1).

At 706 the process determines whether ranking the subject issue usingonly the first i significant characters of the initial rank valuecalculated at 702 is possible. This involves comparing the initiallycalculated rank value truncated to the first i significant characters tothe rank values of the upper and lower neighbors. If the truncatedinitial rank value falls between the higher and lower ranked neighbors(i.e. is greater than the lower ranked neighbor and less than the higherranked neighbor), then this truncated rank value is viable and rankingusing the first i significant characters of the initial rank valuecalculated at 702 is possible. If not (i.e. the truncated initial rankvalue is less than or equal to the rank value of the lower rankedneighbor or is greater than or equal to the rank value of the higherranked neighbor), ranking using the first i significant characters ofthe initial rank value calculated at 702 is not possible.

At 708, in response to determining that ranking the subject issue usingonly the first i significant character is not possible, the significantcharacter index is incremented (i=i+1). The process then returns to 706.

At 710, in response to determining that ranking the subject issue usingonly the first i significant characters is possible, the new rank valueis set to be the first i significant characters of the initial rankvalue calculated at 702.

To illustrate process 700, consider an issue ranking scheme with amaximum rank length of three and allowed characters of 0 to 9. For thisscheme a minimum marker is set at rank “000” and a maximum marker is setat rank “999”. When the first issue is added to the ITS a rank lastoperation is performed—in which case the subject issue is the new issueitself, the higher ranked neighbor is the maximum marker (rank value“999”) and the lower ranked neighbor is the minimum marker (rank value“000”). At 702 the initial rank value for the new issue is calculated tobe: floor((000+999)/2))=499. At 704 the significant character index isset to i=1, and at 706 a determination is made as to whether or notranking using only the first significant character of the initial rankvalue is possible. In this case the first significant character of theinitial rank value is 4, which is greater than the lower ranked neighbor(000) and less than the higher ranked neighbor (999). Accordingly, thedetermination is made at 706 that ranking at the first significantcharacter is possible, and at 710 the new rank value is set to be ‘4’.This provides the ITS with a rank table having: minimum marker rank“000”, new issue rank “4”, maximum marker rank “999”.

By way of second example of process 700, the ITS may maintain twoissues: issue 1 with rank value of “221”; issue 2 with rank value of“225”. A request may be made to rank issue 3 after issue 1, in whichcase the subject issue is issue 3, the higher ranked neighbor is issue 2(rank value “225”) and the lower ranked neighbor is issue 1 (rank value“221”). At 702 the initial rank value for the new issue is calculated tobe: floor((221+225)/2)=223. Following 704 the significant characterindex is set to i=1, and at 706 a determination is made as to whether ornot ranking using the first significant character is possible. In thiscase ranking at first significant character is not possible as thetruncated initial rank value “2” is less than the rank value of thelower ranked neighbor (221). The significant character index isincremented to i=2 (at 708) and at 706 a determination is made thatranking using the first two significant characters is not possible asthe truncated initial rank value (“22”) less than the rank value of thelower ranked neighbor (“221”). The significant character index isincremented to i=3 (at 708). At 706 a determination is made that rankingusing the first three significant characters is possible as the“truncated” initial rank value (“223”) falls between the neighbor rankvalues (“221” and “225”). At 710 the new rank value is set to be thefirst three (given i=3) characters of the initial rank value calculatedat 702: “223”. This provides the ITS with a rank table having: issue 1rank “221”, issue 3 rank “223”, and issue 2 rank “225”.

Alternative processes for minimizing or reducing the length of acalculated new rank value are possible. Generally speaking process 700operates by trying to find the shortest length rank value that fallsbetween two neighbors. An alternative process may operate by finding therank value near the “actual center” of the two neighbors that is nolonger than the maximum length of the two neighbors. In one embodimentthis involves: calculating the maximum length of the rank values of thetwo neighbors (both neighbors may, of course, have the same length);rounding the newly calculated rank value to that maximum rank length;checking if the rounded rank value is equal to either of the neighbors;if the rounded rank value is not equal to either the rank value ofeither of the neighbors returning that rank value; and if the roundedrank value is equal to either the rank value of either of the twoneighbors adding an additional character.

Calculation of New Rank Values: Balancing Rank Operations

Where the rank operation is a balancing rank operation (arising from abalancing process such as that described in Section 3 below) the mannerin which a new rank value is calculated differs.

In the embodiments described in Section 3, rank values include abalancing component and a normal component. The rank value calculationtechniques described below relate to calculating the value of the normalrank component.

Two balancing rank operations described in Section 3 are a start balanceup operation and a start balance down operation. These operationsinvolve balancing the maximum marker issue and minimum marker issuerespectively. For these operations only the balancing component of themarker issue ranks are modified.

The other two balancing rank operations described in Section 3 are abalance issue up operation and a balance issue down operation. In oneembodiment, new rank values in a balance issue up rank operation and abalance issue down operation are calculated with reference to apredefined rank difference. Generally speaking, the predefined rankdifference is selected with a view to spreading the issue rank valuesout between the available normal component rank values as defined by theissue rank scheme.

In a balance issue up rank operation the new normal component rank valuefor the first “real” issue (i.e. not the maximum marker issue) iscalculated to be the middle of the available address range for thenormal component. The new normal component rank values for all followingissues (except the minimum marker) are calculated by subtracting thepredefined rank difference from the normal component rank value of thehigher ranked neighbor. The minimum marker a marker maintains itsoriginal normal component rank value.

In a balance issue down rank operation the new normal component rankvalue for the first “real” issue (i.e. not the minimum marker issue) iscalculated to be the middle of the available address range for thenormal component. The new normal component rank values for all followingissues (except the maximum marker) are calculated by adding thepredefined rank difference to the normal component rank value of thelower ranked neighbor. The maximum marker maintains its original normalcomponent rank value.

In one embodiment, new rank values (in particular new normal componentrank values) in a balancing issue up rank operation and a balancingissue down rank operation are calculated or set to have a predefinedmaximum rebalanced rank length. The maximum rebalanced rank length isless than the maximum allowed rank length for the normal component. Forexample, if the maximum normal component rank length is 253 characters,a maximum rebalanced rank length of five may be set. This defines thatin a balance issue up or balance issue down rank operation new normalcomponent rank values are calculated to have a maximum length of fivecharacters. This still provides 36 to the power of 5 (approximately 60.5million) normal component rank values, but where a varchar rank valuefield is used it allows for smaller rank values to be stored—fivecharacters per issue (or six counting a varchar termination character)instead of 253 characters per issue. As issues are reordered they may,of course, be assigned rank values with longer rank lengths than definedby the maximum rebalanced rank length.

For example a ranking scheme may define a maximum normal component ranklength of six characters with acceptable character values of 0 to 9. Amaximum rebalanced rank length of three characters may be set, and apredefined rank difference of 5. In this case, as a rebalancing downprocess progresses (described in Section 3 below), the issues maintainedby the ITS 100 will take the following normal component rank values:“000000” (the minimum marker issue); “5”, “505”, “51”, “515”, “52”,“525”, etc.

As an alternative example, with acceptable character values of [0-9A-Z], if a maximum balancing rank length of six is set, and predefinedrank difference of 000001, then over 2 billion issues may be rankedbefore “normal” space is exhausted the length of the initial rank valueneeds to be grown for new issues. Systems that need to handle largerissue counts will use a larger maximum balancing rank length and anappropriate predefined rank difference. Furthermore, the initial ranklength and/or predefined rank difference may be recalculated/changedover the course of operating the ITS. For example, as the number ofissues grows (and/or the rate at which issues are being added to the ITSincreases) the initial rank length and/or the predefined rank differencemay be increased.

The above rank operations have been described in the context of an ITS100 that maintains a single ranking of all maintained issues. In someembodiments, however, the ITS 100 may maintain multiple independentrankings of the issues. For example, one rank order may be particular toan individual or a group, and different to the rank order maintained byanother individual or group. This may be facilitated, for example, byincluding an additional field in the data structure to define therelevant user or group whose ranking scheme is being operated on. Inthis case a rank operation request will include information on theuser/group to ensure that the ranking operation is performed on thedesired user/groups ranking scheme. Having identified the relevantranking scheme a given rank operation can proceed as described above.

2.3 Worked Example

In order to further explain the rank operation process described abovethis section provides a worked example. The context of this workedexample is the same as the example initially discussed above in section2.1, with the ITS 100 having issues as shown in Table 7. Table 7includes the same issues as Table 2, as well as minimum and maximummarkers (issue 5 and 6 respectively). Lock value and lock time fieldshave been added to the table and are initially NULL for all issues.

TABLE 7 Issue_ID Issue_Rank Lock_Value Lock_Time 1 AAA 2 AAE 3 AAI 4 AAM5 000 6 ZZZ

As with the above example, assume a first rank operation request is madeto reorder issue 1 so it is positioned immediately before issue 4 and ataround the same time a second rank operation request is made to reorderissue 4 so it is positioned immediately after issue 1.

Thread 1:

The ITS server 104 receives the first request and initiates the rankoperation (at 602) by launching a first thread. A maximum runtime forthread 1 is determined (at 604). The issues relevant to the operationare determined (at 606), their values read (at 608), and a determinationof whether the values are as expected is made (at 610). In this case therelevant issues and issue values (which are as expected) are: thesubject issue 1 with rank value “AAA”, higher ranked issue 4 with rankvalue “AAM”, and lower ranked issue 3 with rank value “AAI”). ITS server104 then attempts to acquire a lock on the relevant issues 1, 3, and 4(at 618), using a UUID of (for example) ‘aaff’. As none of the relevantissues are currently locked (per the NULL rank lock values in Table 7),the lock operation is successful (at 620), and as a consequence lockvalues and time values are written to the relevant issues as shown inTable 8 below:

TABLE 8 Issue_ID Issue_Rank Lock_Value Lock_Time 1 AAA aaff 1000000 2AAE 3 AAI aaff 1000000 4 AAM aaff 1000000 5 000 6 ZZZ

Thread 2:

Thread 1 is then interrupted by thread 2 (i.e. the thread initiated (at602) to perform the second rank operation request). A maximum runtimefor thread 2 is determined (at 604), the issues relevant to the thread 2rank operation are determined (at 606), and the relevant issue valuesare read (608): subject issue 4, rank value “AAM”, locked; lower rankedneighbor issue 1, rank value “AAA”, locked; and higher ranked neighborissue 2, rank value “AAE”, not locked. As issues 1 and 4 are locked thelock acquisition (at 618) is not successful. Thread 2 enters a delay (at624), ultimately sleeping and returning control to thread 1.

Thread 1:

Thread 1 resumes operation by rereading the relevant issue values (at626), determining these are still as expected (at 628), and calculatinga new rank value for subject issue 1 (632). In this example the new rankvalue is calculated to be the rank between the neighbor issues (issues 3and 4)—“AAK”. Thread 1 writes the new rank value to the record inrespect of issue 1 (at 634), releases the locks on the locked issues (at636), and ends. This leaves the state of the rank table as per Table 9below (in Table 9 the lock time values have also been reset to NULL aspart of the lock release operation 636):

TABLE 9 Issue_ID Issue_Rank Lock_Value Lock_Time 1 AAK 2 AAE 3 AAI 4 AAM5 000 6 ZZZ

Thread 2:

With thread 1 completed, thread 2 (once its delay has ended) resumes.

Thread 2 may have delayed several times at 630 over the operation ofthread 1, however for the purposes of this example it will be assumedthat the runtime of thread 2 did not reach the maximum allowed runtime.Thread 2 resumes by determining the issues relevant to the thread 2 rankoperation (at 606) and reading the relevant issue values (at 608). Inthis case the relevant issues and issue values are: the subject issue 4with rank value “AAM”, lower ranked issue 1 now with rank value “AAK”,and higher ranked issue 4 with rank value “AAM”. In this case, theprocess determines that the issue values are not as expected (at 610)and that the requested rank operation is not possible (at 612). In thiscase this is due to the subject issue already being in the requestedorder. Thread 2 then ends, leaving the issue ranks as shown in Table 9above. As can be seen, the resulting rank order is issue 2, issue 3,issue 1, issue 4, and both requests are satisfied.

2.4 Issue Rank Operation Embodiments

In one embodiment, this disclosure provides systems and methods forperforming a rank operation in an ITS. The ITS maintains a plurality ofissues, each issue having an associated rank value, the rank values ofthe plurality of issues defining an order of the plurality issues. Themethod comprises: receiving a rank operation request to change the rankof a subject issue; determining relevant issues to the rank operationrequest; attempting to acquire locks on each of the relevant issues; andin response to successfully acquiring locks on each of the relevantissues: calculating a new rank value for the subject issue, the new rankvalue determined in accordance the rank operation requested; and savingthe new rank value for the subject issue.

The rank operation request may be a reorder request, and the relevantissues may be determined to comprise the subject issue, a higher rankedneighbor issue, and a lower ranked neighbor issue.

The reorder request may be selected from a group comprising: a rankfirst request being a request to rank the subject issue as the firstissue in the rank order; a rank last request being a request to rank thesubject issue as the last issue in the rank order; a rank before requestbeing a request to rank the subject issue so it is ordered immediatelybefore a specified issue; a rank after request being a request to rankthe subject issue so it is ordered immediately after a specified issue.

The new rank value for the subject issue may calculated so the new rankvalue has a length that is less than a maximum issue rank length. Thenew rank value for the subject issue may be calculated so as to minimizethe length of the new rank value.

The rank operation request may be a balance request, and the relevantissues may be determined to comprise the subject issue and a neighborissue.

The balance request may be a balance down request and the neighbor issuemay be a lower ranked neighbor issue. Alternatively, the balance requestmay be a balance up request and the neighbor issue may be a higherranked neighbor issue.

Attempting to acquire locks on the relevant issues may compriseattempting to write lock data to a lock value field associated with eachrelevant issue. An attempt to acquire locks may be successful if lockdata is successfully written to the lock value field associated witheach relevant issue. Lock data may be prevented from being written to agiven issue if the lock value field of the given issue stores a valuethat indicates the issue is already locked.

Attempting to acquire locks on each of the relevant issues may beperformed by a single lock acquisition request, and attempting toacquire locks on the relevant issues may be successful if a returnedvalue of the lock acquisition request indicates that lock data waswritten to each relevant issue.

Lock data may comprise an identifier. Lock data may comprise a uniqueidentifier. Lock data may comprise a UUID.

Each issue may further be associated with a lock time field defining aperiod of time which the issue can remain locked for. If a lock timefield with respect to an issue expires the issue may be unlocked. Thelock time field of a given issue may be written to when a lock on thatissue is acquired.

After saving the new rank value for the subject issue, the method mayfurther comprise releasing the successfully acquired locks.

If the attempt to acquire locks is not successful, the method mayfurther comprise implementing a delay and, following the delay,re-attempting the rank operation.

If implementing the delay results in a maximum runtime being reached orexceeded, the method may comprise terminating the rank operation inrespect of the rank operation request. In this case an error message maybe returned.

If the attempt to acquire locks is not successful, but in the attemptone or more of the relevant issues is locked, the method may furthercomprise unlocking issues that were locked in the unsuccessful lockacquisition attempt.

Unlocking issues that were locked in the unsuccessful lock acquisitionattempt may be performed by a single lock release request.

3. Issue Balancing

3.1 Operational Context and Problem Domains

Over the course of operation of the ITS 100 issues are added and issueorders and rank values are modified. This may result in one or moreareas of the issue rank address space becoming locally congested.

Congestion here refers to issues being assigned ranks that are so closetogether that the number of rank values between adjacent issues (i.e.rank values that can be assigned to other issues that may need to bereordered between those issues) becomes small or zero.

Local congestion is referred to as it is assumed for present purposesthat the ITS 100 implements an issue rank scheme that defines a rankaddress space with significantly more ranks than the number of issuesthat will ever need to be ranked by the ITS 100. By way of example,consider the example address space described above which provides 36 tothe power of 253 unique issue ranks. It is assumed that the ITS 100would, however, never have need to store/track 36 to the power of 253issues—for example, at the time of filing this application a relativelylarge number of issues for an ITS is considered to be 1 million issues.Accordingly, although certain areas or regions of the address space maybecome bunched or congested, other areas of the issue address space willbe uncongested/sparsely populated.

For example, over the course of operation of the ITS 100 four issues mayend up with the ranks as shown in Table 10 (presuming a maximum allowedrank length of three alphanumeric characters and a lexicographicalordering scheme).

TABLE 10 Issue identifier Issue Rank 1 AAA 2 DDA 3 DDB 4 DDC 5 FFF

Should, for example, a reordering operation requesting issue 1 to beranked after issue 3, the reordering operation cannot be completed.Given the maximum character limit of three that has been adopted forthis example it is not possible to add an additional character to therank (e.g. modifying the rank of issue 1 to be “DDBA” which would thenrank between “DDB” and “DDC”). It is also not possible to select a rankfalling between DDB and DDC as under the ordering system these areadjacent ranks. This illustrates the local congestion of ranks aroundissue 3 and issue 4 (having rank values of DDB and DDC respectively). Italso illustrates that there is relatively limited (or no) congestion inother areas—there being a large number of available ranks between issue1 and issue 2 (having rank values of AAA and DDA respectively) andbetween issue 4 and issue 5 (having rank values of DDC and FFFrespectively).

In this example, the only way to rank issue 1 between issue 3 and issue4 without changing the underlying issue rank scheme is to re-rank atleast one of issue 3 or issue 4 to create available issue ranks betweenthem. This type of operation will be referred to as an issue balancingoperation. In an issue balancing operation the rank values of one ormore issues are changed, but the order of the issues maintained by theITS 100 is not altered—i.e. after a balancing operation no issue haschanged to be ordered before an issue it was previously ordered after,or to be ordered after an issue it was previously ordered before.

Returning to the above example, on detecting the congestion thatprevents a reordering operation one option is to pause the reorderingoperation and instigate a balancing operation that re-ranks issue 4 tocreate space between issue 4 and issue 3 (e.g. by re-ranking issue 4 tohave a rank value of EEE). Having to pause the reordering operation,however, impacts on the performance experienced by the user or processawaiting completion of that operation. Furthermore, this solution doesnot address the congestion between issues 2 and 3 (having ranks DDA andDDB respectively).

An alternative option would be to lock up the entire ranking datastructure to redistribute issues more evenly. While the data structureis so locked, however, no other issue ranking operations (e.g. issuereordering operations) could be performed. This would be a significantinterruption to users of the ITS.

Accordingly, there is a need for techniques that improve the managementof issues in such a way as to avoid, or at least reduce, the occurrenceof issue rank clustering.

3.2 Implementation

In one embodiment a global rebalancing process is provided in which allissues maintained by the ITS are rebalanced in order to alleviate rankcongestion. In order to facilitate issue balancing the issue rankingscheme defines that issue rank values include one or more charactersthat make up a balancing component and define a balancing rank. Thisbalancing component is to be contrasted with the characters making up anormal component of a rank value, which is used in normal issuereordering operations. In the examples described in Section 2 above, therank characters were all part of a normal component. I.e. in the threecharacter issue ranks (“AAA”, “BBB”, etc.) all three characterscomprised the normal component, and were used in the normal rankordering of issues.

Part of the ordering system for a ranking scheme is the significanceattached to each character in a rank value. This defines the order inwhich the various characters making up an issue rank value areconsidered. Generally speaking, the characters in a given issue rankvalue sequentially range from a most significant character of the issuerank value to a least significant character of the issue rank value.Although unusual, custom order systems may define alternative—andpotentially non-sequential—character significance orders.

For example, in the three alphanumeric character issue values describedabove (giving an issue rank value such as “ABC”) the lexicographicalorder system defined the first/leftmost character (in this case ‘A’) tobe the most significant character and the last/rightmost character (inthis case ‘C’) to be the least significant character. As a consequenceof this, rank value “ABB” ranks before rank value “BBA”. If thecharacter significances were reversed, however (e.g. if the orderingsystem defined the rightmost character to be the most significantcharacter and the left most to be the least significant character), rankvalue “ABB” would rank after rank “BBA”. Unless stated otherwise, andfor ease of human readability, the ordering systems used hereinpresume/define the most significant character to be the first/leftmostcharacter of a rank value.

The balancing component of an issue rank value is of greatersignificance (from an ordering perspective) than the normal component ofthat issue rank value. In general terms, an issue scheme defines amaximum allowed rank length of n characters, a balancing componentcomprising a of the n characters, and a normal component comprising b ofthe n characters. Although issue ranks in this Section are described interms of a balancing component and a normal component, it is importantto note that these two components can be read together and treated as asingle or unitary rank value when determining the rank order of anissue.

If all n characters are used by the balancing and normal components of arank value a+b=n. In some cases, however, one or more of the rank valuecharacters may be used for other purposes, in which case a+b<n. Evenwhere characters are used for other purposes they are still treated aspart of the single/unitary rank value when determining rank order.

For the purposes or description, the rank values described in thisSection will take the following format: “0|AAA”, defined as follows.Rank values are defined to have a maximum allowed rank length of fivecharacters (n=5). A balancing component of one character (a=1) isdefined, the balancing component being the most significant character ofthe rank value (the character ‘0’ in the rank value “0|AAA”). Thebalancing component character is defined to have acceptable values of 0,1, or 2, thereby defining three balancing ranks. One reserved characteris defined, being the next most significant character after thebalancing component. In this case the reserved character is a pipecharacter ‘|’, provided solely for the purposes of human readability,and is not a necessary inclusion in the issue ranking scheme. The pipecharacter is a static character, in the sense that it is the same in allrank values—a consequence of which being that it has no impact on rankordering. The normal component is defined to have a maximum of threecharacters (a=3) being the least significant three characters of therank value (the characters “AAA′” in the rank value “0|AAA”). In thisexample the normal component is the same as the rank scheme used in therank operation examples described in Section 2 above: i.e. a maximumnormal component length of three characters, each character defined tohave acceptable values of 0 to 9 or A to Z. The normal componenttherefore describes 36 to the power of 3 (46656) normal component ranks.

The balancing component of a rank value can be thought of as defining aparticular bucket in which a normal rank (as defined by the normalcomponent of the rank value) is held. For example, the rank value of“0|AAA” can be thought of as an issue with normal rank “AAA” (the normalcomponent of the rank value) which is held in bucket “0” (the balancingvalue as defined by the balancing component of the rank value). Incontrast, a rank value of “1|BBB” can be thought of as an issue withnormal rank “BBB” which is held in bucket “1”. The number of balancingvalues (or buckets) defined by an issue ranking scheme is defined by thenumber of characters in the balancing component and the possible valuesof those characters.

While issue ranks of the format “0|AAA” are used to describe theprinciples of this embodiment, issue rank schemes of actual ITSimplementations will typically define far larger issue rank formats. Asan example, an issue rank format for an actual ITS may be defined ashaving: a maximum allowed rank length of 255 characters (n=255); abalancing component of one character (a=1), the balancing componentbeing the most significant character of the rank value and havingacceptable values of 0, 1, or 2; a static pipe character, being nextmost significant character after the rank component; and a normalcomponent having a maximum of 253 characters, being the next mostsignificant characters after the pipe character. This provides for rankvalues of the form: “O|AAA . . . A”. The balancing component of thisrank format provides for three balancing values (0, 1, or 2). The normalcomponent of this format provides for 36 to the power of 253 normal rankvalues. Relevantly, and as discussed above, the normal component of therank format provides ample normal rank values (36 to the power of 253)to rank the number of issues that will need to be maintained by the ITS100. As such the balancing component is not added or included out of aneed to extend the number of issue ranks—this is not its purpose.Rather, the purpose of the balancing component is to facilitate thebalancing of issues.

More generally, and within any environmental limitations (e.g. maximumfield lengths or the like) an issue ranking scheme may define one ormore balancing characters, one or more special/reserved characters, andone or more normal component characters as desired. The one or morebalancing characters (and their allowed values) must define at least twodistinct balancing ranks (i.e. at least two buckets). The number ofnormal component characters (and their allowed values) will typicallydefine a number of normal ranks that is ample to rank the number ofissues that the ITS 100 is likely to need to maintain.

In addition to defining balancing and normal components, the issue rankscheme also defines a balancing progression. The balancing progressiondefines the order in which balancing ranks (as defined by the balancingcomponent) are transitioned through. For example, where only twobalancing values are defined (e.g. 0 and 1), then the order of balancingis from 0 to 1, and from 1 back to 0. Where n balancing issues aredefined, the balancing order may be: sequentially up with a reset fromthe highest balancing rank back to the lowest balancing rank—i.e. 0 to1, 1 to 2, . . . , (n−1) to n, n to 0, 0 to 1, etc.; sequentially downwith a reset from the lowest balancing rank back to the highestbalancing rank—i.e. 0 to n, n to (n−1), . . . , 2 to 1, 1 to 0, 0 to n,etc.; oscillating—i.e. 0 to 1, 1 to 2, . . . , (n−1) to n, n to (n−1), .. . , 2 to 1, 1 to 0, 0 to 1, etc.; or a custom defined progression. Asingle balancing process from one balancing component value to anotherbalancing component value (i.e. from one bucket to another) will eitherbe a balancing up process in which issues are balanced from a lowerbalancing rank to a higher balancing rank, or a balancing down processin which issues are balanced from a higher balancing rank to a lowerbalancing rank.

In certain environments, balancing in a particular direction (e.g. up ordown) may be more efficient. In such environments the number ofbalancing ranks defined by the balancing component and the balancingprogression can be selected to take advantage of this. For example, in aparticular environment balancing up may be more efficient than balancingdown. For this environment a single character balancing component may beused with acceptable values of 0-9 or A-Z (providing a total of 36balancing ranks), and a balancing progression that balances sequentiallyupwards with a reset. In this case a greater number of more efficientbalancing up processes (36) can be performed for each less efficientdownward balancing down process.

FIG. 8 illustrates a process 800 of balancing issues maintained by theITS 100. Prior to process 800 being performed, all issues maintained bythe ITS 100 have the same balancing component rank (i.e. are held in thesame bucket). In the case of a new ITS 100 that has not undergone abalancing process, all issues will have the same balancing rank as theywill have been assigned the same balancing rank on creation. For anexisting ITS 100 that is being updated to provide issues with abalancing component (in addition to their previously existing normalcomponent), all issues are given the same balancing component.

At 802, the balancing process is triggered. Balancing may be triggeredin a variety of ways. For example, balancing may be manually triggeredby a user on detection that the ranking address space has becomecongested in one or more areas. Balancing may be triggered based on adefined balancing schedule—i.e. ITS 100 is configured to perform abalancing process every x days/weeks/months. Balancing may also beautomatically triggered, for example as is described in Section 3 below.

In a multiple server (or clustered) environment, only one node/ITSserver 104 should perform balancing of the rank system at a time. Tothis end, in a clustered environment a check (not depicted) is madebefore commencing a balancing process to ensure that a balancing processis not currently in progress under the control of another node. Thischeck may be performed in a variety of ways, for example by reference toa cluster wide balancing lock. If the balancing lock indicates balancingis currently being performed, another balancing process is notcommenced. If the balancing lock does not indicate that balancing iscurrently being performed the balancing lock is set and the balancingprocess proceeded with. In this case once the balancing process hascompleted the balancing lock is released.

At 804, the process determines a new balancing component rank. The newbalancing component rank is based on the existing balancing componentrank of the issues maintained by the ITS, the allowed balancingcomponent rank values, and the balancing progression. The new balancingcomponent rank defines the bucket into which the issues will be balancedover the course of the balancing process.

In the example ranking scheme described above, the balancing componentcomprises a single character having allowed values of 0, 1, or 2. Inthis embodiment the balancing progression is a sequential upwardprogression with a reset (i.e. issues are balanced from balancing rank 0to balancing rank 1, from balancing rank 1 to balancing rank 2, and frombalancing rank 2 to balancing rank 0).

At 806, the process determines whether the process is a balancing upprocess or a balancing down process. This determination is based on theexisting balancing component rank and the new balancing component rankdetermined at 804. If the existing balancing component rank is lowerthan the new balancing component rank the process will be a balance upprocess. If the existing balancing component rank is higher than the newbalancing component rank the process will be a balance down process.

The balancing up and balancing down processes are similar. The generaldifference is that in a balancing up process issues are balanced inorder from highest to lowest (i.e. the highest ranked issues arebalanced first), while in a balancing down process issues are balancedin order from lowest to highest (i.e. the lowest ranked issues arebalanced first). This ensures that the balancing process does not affectthe relative order of the issues maintained by the ITS 100. Theoperations involved in a balance up process will be described first,followed by the operations involved in a balance down process.

The balance up process is started at 808 by balancing the maximum markerto the new balancing component rank. This involves assigning the newbalancing component rank to the maximum marker (i.e. moving the maximummarker to the new bucket).

In one embodiment the maximum marker is moved by requesting a startbalance up operation, which is a type of rank operation as described inSection 2 above. For a start balance up rank operation the relevantissues (determined at 606) are the maximum marker issue and the issuewith the next highest rank (i.e. the highest ranked “real” issuemaintained by the ITS 100). Provided the data with respect to theseissues is as expected (determined at 610), locks on the relevant issuesare successfully acquired (determined at 620), and the data with respectto the relevant issues is still as expected (determined at 628), a newrank value is determined (at 632). The new rank value of the maximummarker comprises the new balancing rank (determined at 804) and thepreexisting normal component of the maximum marker. The new rank valueis then saved (at 634) and the acquired locks released (at 636).

At 810 the process determines whether the start balance up operation wassuccessful. In this embodiment success is determined by receiving areturned value from the rank operation indicating success (e.g. from616). Alternatively, success may be determined by a predefined timeperiod elapsing without receiving a failure message.

At 812, in response to determining the start balance up operation wassuccessful, the process determines the next issue to be balanced. Thenext issue to be balanced in a balance up process is the highest rankedissue with the original balancing component rank value (i.e. the highestranked issue that is in the original bucket).

At 814 the process balances the next issue (as determined at 812).

Balancing an issue generally involves calculating a new rank value forthe issue and saving that new rank value. The new rank value is acombination of a new balancing component rank value (as determined at804) and a new normal component rank value. The new normal componentrank value is calculated so that as the balancing process progresses theissues maintained by the ITS are given normal component rank values thatdistribute them within the normal rank component address space. Thisresults in any congested areas being decongested. By using a balancingcomponent as described, the ITS 100 can reorder issues within the normalrank component address space without concern that doing so will changethe actual order of the issues relative to one another. Putalternatively, the order of an issues immediately before the balancingoperation in respect of a given issue is the same as the order of theissues immediately after the balancing operation in respect of the givenissue. The balancing component of the rank is used to ensure that theoverall order of the issues is maintained.

In one embodiment the next issue is balanced by requesting a balanceissue up operation in respect of the issue determined at 812. This is atype of rank operation as described in Section 2 above, the relevantissues for which (as determined at 606) being the subject issue and ahigher ranked neighbor. The subject issue is the issue being balanced asdetermined at 812, and may be the minimum marker issue. The higherranked neighbor is the issue with the next highest rank to the subjectissue, and may be the maximum marker issue. For a balance issue up rankoperation, the subject issue and higher ranked neighbor should havedifferent balancing component ranks (as defined by the value(s) of thebalancing component). Accordingly, determining whether the relevantissue data is as expected for a balance issue up operation (at 610)involves checking that the balancing rank of the subject issue isdifferent to the balancing rank of the higher ranked neighbor. If thebalancing ranks of these issues are the same, this is not expected. Thismay (for example) indicate that another rank operation has ordered anissue between the subject issue determined at 812 and the intendedhigher ranked neighbor issue. In this case the intervening issue shouldbe balanced before the subject issue is balanced.

As per the rank operations described in Section 2 above, if the relevantissue data is as expected, locks on the relevant issues are successfullyacquired (as determined at 620), and the data with respect to therelevant issues is still as expected (as determined at 630), a new rankvalue for the subject issue is determined (at 632).

The balancing component of the new rank value in a balance up operationis the new balancing rank determined at 804. As described in Section 2above, in one embodiment the new normal component value in a balance upoperation is (except for the minimum marker) calculated by subtracting apredefined rank difference from the normal rank of the higher rankedneighbor. As described in Section 2, this calculation may be performedwithin the constraint of a maximum balancing rank length (i.e. a maximumlength that the calculated normal component of the new rank value cantake). When the minimum marker is balanced in a balance up operation itmaintains its original normal component rank value.

Once calculated the new rank value is saved (at 634) and the acquiredlocks released (at 636).

At 816 the process determines whether the balance issue up operation wassuccessful (e.g. by receipt or otherwise of a success message returnedby 616).

At 818 the process determines whether further issues require balancing.This may be achieved in a variety of ways. In one embodiment, in abalance up process if the last issue moved was the minimum marker theprocess will determine that no further issues require balancing.Alternatively, the process may determine that no further issues requirebalancing if all issues have the same balancing component.

If further issues require balancing the process returns to 814 todetermine the next issue to be balanced.

If no further issues require balancing the balancing process ends. Insome embodiments the completion of the balancing operation is recordedand/or a message to this effect is sent.

As noted, the balance down process is, in many respects, similar to thebalance up process. The balance down process is started at 820 bybalancing the minimum marker to the new balancing rank. This involvesassigning the new balancing rank to the minimum marker (i.e. moving theminimum marker to the new bucket).

In one embodiment the minimum marker is moved by requesting a startbalance down operation. This is a rank operation as described in Section2 above. For a start balance down rank operation the relevant issues (asdetermined at 606) are the minimum marker issue and the issue with thenext lowest rank (i.e. the lowest ranked “real” issue maintained by theITS 100). Provided the data with respect to these issues is as expected(610), locks on the relevant issues are successfully acquired (620), andthe data with respect to the relevant issues is still as expected (628),a new rank value is determined (632). The new rank value of the minimummarker comprises the new balancing rank (determined at 804) and thepreexisting normal component of the minimum marker. The new rank valueis then saved (634) and the acquired locks released (636).

At 822 the process determines whether the start balance down operationwas successful.

At 824, if the start balance down operation was successful, the processdetermines the next issue to be balanced. The next issue to be balancedin a balance down process is determined to be the lowest ranked issuewith the original balancing rank (i.e. the lowest ranked issue that isin the original bucket).

At 826 the process balances the next issue (as determined at 824).

In one embodiment the next issue is balanced by requesting a balanceissue down operation in respect of the issue determined at 824, which isa rank operation (as described in Section 2 above). For a balance issuedown rank operation the relevant issues (as determined at 606) are thesubject issue and a lower ranked neighbor. The subject issue is theissue being balanced as determined at 824, and may be the maximum markerissue. The lower ranked neighbor is the issue with the next lowest rankto the subject issue, and may be the minimum marker issue. For a balanceissue down rank operation, the subject issue and lower ranked neighborshould have different balancing ranks (as defined by the value(s) oftheir balancing components). Accordingly, determining whether therelevant issue data is as expected for a balance issue down operation(at 610) involves checking that the balancing rank of the subject issueis different to the balancing rank of the lower ranked neighbor. If thebalancing ranks of these issues are the same, this is not expected.

If the relevant issue data is as expected, locks on the relevant issuesare successfully acquired (as determined at 620), and the data withrespect to the relevant issues is still as expected (as determined at630), a new rank value for the subject issue is determined (at 632).

The balancing component of the new rank value in a balance downoperation is the new balancing rank determined at 804. As described inSection 2 above, in one embodiment the normal component value of the newrank in a balance down operation is (except for the maximum marker)calculated by adding a predefined rank difference to the normalcomponent rank value of the lower ranked neighbor. As described inSection 2, this calculation may be performed within the constraint of amaximum balancing rank length. When the maximum marker is balanced in abalance down operation it maintains its original normal component rankvalue.

Once calculated the new rank value is saved (at 634) and the acquiredlocks released (at 636).

At 828 the process determines whether the balance issue down operationwas successful (e.g. by receipt or otherwise of a success messagereturned by 616).

At 830, in response to determining the balance issue down operation wassuccessful, the process determines whether further issues requirebalancing. This may be achieved in a variety of ways. In one embodiment,in a balance down process if the last issue moved was the maximum markerthe process will determine that no further issues require balancing.Alternatively, the process may determine that no further issues requirebalancing if all issues have the same rank value.

If further issues require balancing the process returns to 824 todetermine the next issue to be balanced.

If no further issues require balancing the balancing process ends. Insome embodiments the completion of the balancing operation is recordedand/or a message to this effect is sent.

At a number of points during the balance up process (at 810 and 816) andthe balance down process (822 and 828) a determination is made as to thesuccess of a balance rank operation. In one embodiment, at 832, if anyof these rank operations is unsuccessful—determined, for example, byreceiving an error message or due to a request timing out—the processgenerates and communicates a balance error message and ends. Inalternative embodiments if a balance operation is unsuccessful a delaymay be implemented (for example in a similar manner to the delaydescribed at 624 above) and, provided a maximum runtime for thebalancing operation has not been exceeded, the balancing operationretried. This may be appropriate where balance operations (as attemptedat 808, 814, 820 or 826) are performed by an alternative rank operationprocess to that described in Section 2 above, and the alternative rankoperation process does not itself involve retrying a rank operation onan initial failure.

By compartmentalizing issue ranks into a balancing component and anormal rank component it is possible to balance issues from one bucketto another without impacting the order of the issues maintained by theITS. This also allows for balancing of issues to occur without lockingup the entire data structure. This is advantageous as in somecircumstances a balancing can take a long time and it is not acceptablefor the data structure to be inaccessible over that period. For example,in the process described above it is entirely possible for a request toreorder issues to be received and processed during rebalancing. In thiscase the reorder and balancing processes can carry on as normal and inparallel without interfering with one another.

In an alternative implementation, buckets are defined without using abalancing component. In this embodiment, rather than dedicating one ormore characters to explicitly defining a balancing rank differentbuckets are defined by ranges of rank values within the allowable rankvalues as defined by the issue ranking scheme.

For example, in a ranking scheme defining a maximum rank length of threeand available characters as 0-9, the ITS may define a first “bucket” tobe the rank values of “000”-“499” and a second “bucket” to be the rankvalues of “500”—“999”. In this case the “current” bucket into whichissues are being ranked is defined by the minimum and maximum markers.For example, initially the first bucket may be used in which caseminimum and maximum marker issues are set to the boundary rank valuesfor that range defining that bucket—in this case “000” and “499”. As aconsequence, issue rank operations will result in issues being betweenthese values.

When a rebalance operation is triggered a new bucket is selected. Thismay be according to a rebalance progression as described above, thoughin this case the rebalance progression defines the new range of rankvalues that will define the next bucket. Continuing the example above,the balance progression will define the next bucket to be defined by therange “500” to “999” (which, in this case, will be a balance upoperation). The rebalancing up operation is performed by first changingrank value of the maximum marker to the upper boundary of the new bucketrange—in this case to “999”. All issues maintained by the ITS are thenbalanced up in a similar fashion to that described above—i.e. higherranked issues being rebalanced before lower ranked issues—with theexception that no balance component needs to be calculated. New rankvalues may be calculated, for example, by subtracting a predefinednumber of issue ranks from the higher ranked neighbor of the specificissue being balanced (the predefined number of issue ranks defined withreference to the number of ranks defined by the bucket range). Once allissues have been balanced, the minimum marker is then moved to lowerboundary of the bucket range—in this case “500”. Following therebalancing issues will be ranked in the new bucket—between “500” and“999”, and as the minimum and maximum markers now define the boundariesof the range all new rank operations will rank issues within thatbucket.

Balancing down is similarly achieved. Initially the rank value of theminimum marker is set to the lower boundary of the bucket range. Issuesare then sequentially balanced into the new range from the lowest rankedissue to the highest ranked issue. New rank values may be calculated,for example, by adding a predefined number of issue ranks to the lowerranked neighbor of the specific issue being balanced (the predefinednumber of issue ranks defined with reference to the number of ranksdefined by the bucket range). Lastly the rank of the maximum marker isset to the upper boundary of the bucket range.

The ITS may divide the available issue ranks into multiple buckets bydefining multiple distinct ranges within the issue ranks defined by theissue ranking scheme. Typically, each bucket will define significantlymore rank values than the number of issues it is envisaged the ITS willneed to maintain.

For example in an issue ranking scheme providing issue ranks from0,000,000 to 9,999,999 three buckets may be defined, each having around3,333,330 usable rank values (noting two rank values are lost to theminimum and maximum markers). In this example: bucket 1 is defined bythe rank value range 0,000,000 to 3,333,333; bucket 2 is defined by therank value range 3,333,334 to 6,666,666; and bucket 3 is defined by therank value range 6,666,667 to 9,999,999. When bucket 1 is the activebucket, the minimum marker is ranked 0,000,000, the maximum marker isranked 3,333,333, and issues take rank values 0,000,001 to 3,333,332.When bucket 2 is the active bucket, the minimum marker is ranked3,333,334, the maximum marker is ranked 6,666,666, and issues take rankvalues 3,333,335 to 6,666,665. When bucket 3 is the active bucket, theminimum marker is ranked 6,666,667, the maximum marker is ranked9,999,999, and issues take rank values 6,666,668 to 9,999,998.

3.3 Worked Example

In order to further explain the balancing process described above, thisSection provides a worked example. For this worked example the currentstate of the ITS 100 is as shown in Table 11. This example works on theissue rank scheme described above: a single character balancingcomponent being the most significant character and capable of taking thevalues 0, 1, and 2; a pipe character as the next most significantcharacter; a maximum normal component length of three, each charactercapable of taking any value of 0 to 9 or A—Z; and a balancingprogression of balancing rank 0 to balancing rank 1, balancing rank 1 tobalancing rank 2, and balancing rank 2 to balancing rank 0.

Table 11 depicts four “real” issues 1, 2, 3, and 4, a minimum markerissue 5, and a maximum marker issue 6. Each issue has an initialbalancing rank (defined by the balancing component) of 0:

TABLE 11 Issue_ID Issue_Rank 1 0|XXA 2 0|XXB 3 0|XXC 4 0|XXD 5 0|000 60|ZZZ

As can be seen, the example issues illustrated in Table 11 are congestedas there are no more normal component rank values between any of issues1, 2, 3, or 4.

Once the balancing process has been triggered (at 802), the processdetermines the next balancing rank to be 1 (at 804). This is based onthe current balancing rank of the issues, the available balancing ranks,and the balancing progression.

The process then determines that a balance up process will be performed(at 806) given the new balancing rank of 1 is higher than the existingbalancing rank of 0.

The process then starts balancing up (at 808) by balancing the maximummarker row. Following this operation the rank table is as shown in Table12:

TABLE 12 Issue_ID Issue_Rank 1 0|XXA 2 0|XXB 3 0|XXC 4 0|XXD 5 0|000 61|ZZZ

The process then determines the next issue to be balanced (at 812)—issue4, and balances issue 4. The process then balances issue 4. In thisexample the new normal rank is calculated to be “H00”, giving issue 4 arank of “11H00” as shown in Table 13 below:

TABLE 13 Issue_ID Issue_Rank 1 0|XXA 2 0|XXB 3 0|XXC 4 1|H00 5 0|000 61|ZZZ

The process then determines that there are additional issues to bebalanced (at 818). The process proceeds by balancing issue 3 (with, inthis example. a rank of “1|G00”), followed by issue 2 (with, in thisexample. a rank of “1|F00”) Following these two operations the ranktable is as shown in Table 14:

TABLE 14 Issue_ID Issue_Rank 1 0|XXA 2 1|F00 3 1|G00 4 1|H00 5 0|000 61|ZZZ

As can be seen, following this operation the normal component rank ofissue 2—“F00”—is (if taken alone) ranked before the normal componentrank of issue 1—“XXA”. The balancing component, however, ensures thatthe original order of the issues is maintained, with “1|F00” stillranked after “0|XXA”.

The process then determines that there are additional issues to bebalanced (818), determines (at 812) the next issue to be issue 1, andbalances issue 1 giving it a new rank value of “1|E00”. The minimummarker (issue 5) is then balanced and given a new rank value of “11000”(issue 5 retaining its original normal rank component value due to beingthe minimum marker). After balancing issue 5 the process determines thatno further issues to balance. On completion of the balancing the ranktable is as shown in Table 15:

TABLE 15 Issue_ID Issue_Rank 1 1|E00 2 1|F00 3 1|G00 4 1|H00 5 1|000 61|ZZZ

The worked balancing example has presumed no intervening reorderingoperations occurred during balancing. Given this, and as can be seen,the order of the issues relative to one another throughout the balancingprocess, and on completion of the balancing process, is the same as theorder of the issues relative to one another before the balancing processcommenced. On completion of the balancing process, however, thecongestion has been alleviated with multiple potential ranks nowexisting between issues 1, 2, 3, and 4.

In order to illustrate an implementation making use of a maximumbalancing rank length an additional rebalancing example will be brieflydescribed. This example presumes: a single character balancing componentbeing the most significant character and capable of taking the values 0,1, and 2; a pipe character as the next most significant character; amaximum normal component rank length of 5, each character capable oftaking any integer value 0 to 9; a balancing progression of balancingrank 0 to balancing rank 1, balancing rank 1 to balancing rank 2, andbalancing rank 2 to balancing rank 0; a maximum balancing rank length oftwo; and a predefined rank difference of five. Table 16 depicts thestarting point for the rebalancing process:

TABLE 16 Issue_ID Issue_Rank 1 2|33334 2 2|33335 3 2|33336 4 2|33337 52|0 6 2|99999

Once the balancing process has been triggered (at 802), the processdetermines the next balancing rank to be 0 (at 804). The process thendetermines that a balance down process will be performed (at 806) giventhe new balancing rank of 0 is lower than the existing balancing rank of2.

The process then starts balancing down (at 820) by balancing the minimummarker row. Following this operation the rank table is as shown in Table17:

TABLE 17 Issue_ID Issue_Rank 1 2|33334 2 2|33335 3 2|33336 4 2|33337 50|0 6 2|99999

The process then determines issue 1 to be the next issue to be balanced(at 824) and balances issue 1. The balancing component of issue 1 is setto 0. The new normal component value of issue is calculated within thebounds of a maximum balancing rank length of two and a predefined rankdifference of 05. Accordingly, the new normal component value is thenormal component rank value of the lower ranked neighbor (issue 4, “00”)plus the predefined rank difference (5), giving a new normal componentvalue of “05”. This is shown in Table 18 below:

TABLE 18 Issue_ID Issue_Rank 1 0|05 2 2|33335 3 2|33336 4 2|33337 5 0|06 2|99999

The process then determines that there are additional issues to bebalanced (at 830), determines issue 2 to be the next issue to bebalanced (at 824), and balances issue 2. The new normal component valuefor issue 2 is calculated to be the normal component of the lower rankedneighbor (issue 1, 05) plus the predefined rank difference (5), giving anew normal component value of 1. In a similar fashion issues 3 and 4 arerebalanced (in that order). The maximum marker issue is then rebalanced,ending up in the rankings as shown in Table 19:

TABLE 19 Issue_ID Issue_Rank 1 0|05 2 0|1 3 0|15 4 0|2 5 0|0 6 0|99999

As with the previous worked example, the order of the issues relative toone another throughout the process, and on completion of the process, isthe same as the order of the issues relative to one another before thebalancing process commenced. In addition to alleviating congestion, theprocess has also reduced the normal component rank lengths to a maximumof two (excepting the minimum and maximum markers).

3.4 Issue Balancing Embodiments

In one embodiment, this disclosure provides systems and methods forperforming an issue balancing process in an ITS. The process comprises:defining an issue ranking scheme which defines allowable rank values anda plurality of issue buckets; maintaining a plurality of issues, eachissue having an associated issue rank within the issue ranking schemewhich defines the order of the issue with respect to other issues;performing one or more balancing operations, each balancing operationbeing in respect of a given issue and comprising: determining a new rankvalue for the given issue, the new rank value resulting in the givenissue being moved from a current bucket to a new bucket, and wherein thebalancing operation does not affect the order of the given issue withrespect to other issues.

Issue buckets may be defined by ranges of issue rank values. Determininga new rank value in a balancing operation may comprise determining a newrank value falling within the range of rank values defining the newbucket. A balance operation may be a balance down operation, and a newrank value may be determined by adding a predefined rank difference to arank value of a previously rebalanced issue. Alternatively, a balanceoperation may be a balance up operation, and a new rank value may bedetermined by subtracting a predefined rank difference to a rank valueof a previously rebalanced issue.

The rank value of a given issue may comprises a balancing component anda normal component which are read together as the rank value, and theissue buckets may defined by the balancing component of the rank value.

The balancing component may be of a greater significance than the normalcomponent from an order determination perspective.

Determining a new rank value in a balancing operation may comprisedetermining a new balancing component rank value defining the new bucketand determining a new normal component rank value defining a rank withinthe new bucket.

A balance operation may be a balance down operation, and a new normalcomponent rank value may be determined by adding a predefined rankdifference to a normal rank value of a previously rebalanced issue. Abalance operation may be a balance up operation, and a new normalcomponent rank value may be determined by subtracting the predefinedrank difference to a normal rank value of a previously rebalanced issue.

Determining a new rank value may comprise determining the new rank valueto have a rank length of less than a maximum issue rank length.

The balancing process may comprise sequentially performing balancingoperations on all issues maintained.

The method may further comprise determining a direction of the balancingprocess.

The direction of the balancing process may be determined with referenceto relative rankings of the current bucket the issues are ranked in andthe new bucket the issues are to be balanced into. If the new bucket hasa higher rank than the current bucket a balance up process may bedetermined. If the new bucket has a lower rank than the current bucket abalance down process may be determined.

If the balancing process is determined to be a balance up process, thebalancing process may comprise performing balancing operations on higherranked issues before lower ranked issues. The balancing up process maycomprise first balancing a maximum marker, the maximum marker defining amaximum rank value.

If the balancing process is determined to be a balance down process, thebalancing process may comprise performing balancing operations on lowerranked issues before higher ranked issues. The balancing down processmay comprise first balancing a minimum marker, the minimum markerdefining a maximum rank value.

A balancing operation may be a rank operation, and may be performed inaccordance with a balancing rank operation as described in Section 2above.

4 Rebalancing Trigger

4.1 Operational Context and Problem Domains

As described above, congestion in an ITS ranking is problematic, but canbe alleviated by balancing the issues.

One way of determining when issues should be balanced is to wait for areordering operation to fail. For example, a reordering rank operationwill fail if there are no available ranks between two issues and a userrequests to place a third issue between those two issues. An example ofthis is discussed in relation to Table 10 above. While a failed reorderoperation can be used to trigger a balancing of the issues maintained bythe ITS, relying on this as the sole trigger is undesirable as it relieson an operation to fail which will impact on the performance of thesystem and, potentially irritate users.

As an alternative, a decision could be made to routinely perform abalancing process at a defined frequency—e.g. every x days/months/years.If the frequency chosen is sufficiently high this should reduce thelikelihood of reordering operations failing due to congestion, but doesnot guarantee it. Furthermore, it may result in rebalancing processesbeing performed when there is no real congestion in the ranking system,in which case the rebalancing process is unnecessary and wastesresources.

A further alternative way of determining when issues should be balancedmay be to periodically scan the rankings of the issues maintained by theITS, looking for congestion—e.g. areas where issue ranks are closetogether. Performing such a scan, however, may be computationallyintensive (particularly if the ITS maintains multiple distinct rankingsfor the issues maintained), and as such may also impact on performance.

Accordingly here is a need for a better way to determine when an issuebalancing operation in an ITS should be performed.

4.2 Implementation

In one embodiment, a rebalancing trigger is defined. Activation of therebalancing trigger results in a balancing process being commenced orscheduled to commence.

Generally speaking, a rebalancing trigger is based on a new issue rankvalue that is calculated during a rank operation, and in particular thelength of a new issue rank value. If in a rank operation a new issuerank value is calculated that has a length exceeding a predefinedtrigger length, a rebalancing process is triggered.

Activation of a rebalancing trigger may result in a balancing operationcommencing immediately. In one embodiment, however, triggering of abalancing process does not result in the balancing process commencingimmediately. Instead, once a balancing process has been triggeredcommencement is delayed. The delay may be defined so that the balancingprocess commences at a time that is expected to be a low activity timefor the ITS (i.e. a time when users are performing relatively few rankor other ITS operations—e.g. during the night or early morning). In thisway any impact of the balancing process on users is reduced.

In one embodiment the delay associated with a particular rebalancingtrigger is related to the predefined trigger length for that rebalancingtrigger. Generally speaking, a predefined trigger length that isrelatively close to the maximum allowed rank length will have arelatively short delay. This is because activation of the trigger willbe an indication of relatively high congestion. Conversely, a predefinedtrigger length that is relatively short compared to the maximum allowedrank length will have a longer delay as activation of the trigger isindicative of less congestion in the rank address space.

For example, if an issue ranking scheme defines a maximum allowed ranklength of six characters, each character taking a value between 0 to 9and A to Z, a particular rebalancing trigger may have a predefinedtrigger length of five (five being relatively close to the maximumallowed rank length of six). In this case, activation of the triggermeans that a rank value of five characters has been calculated during arank operation—e.g. “AAAAA”. Should a rank value for another issue becalculated as an adjacent five character rank value (e.g. “AAAAB”) thenonly 36 more issues can be ranked between those two issue (i.e. “AAAAAO”to “AAAAAZ”), and as such a balancing operation should be scheduled tocommence with a relatively small delay. Conversely, a rebalancingtrigger may have a predefined trigger length of three (three in thiscase being relatively short compared to the maximum allowed rank lengthof six). In this case, activation of the trigger means that a rank valueof three characters has been calculated—e.g. “AAA”. Should a rank valuefor another issue be calculated as an adjacent three character rankvalue (e.g. “AAB”) there are still 36 to the power of three (46656)available ranks between these two issues (i.e. “AAAAAA” to “AAAZZZ”). Inthis case a longer delay before commencing the balancing process isacceptable.

In one embodiment, multiple rebalancing triggers are defined. In thisembodiment each rebalancing trigger has a different predefined triggerlength and a different associated delay period that, when the trigger isactivated, is instigated before a balancing process is commenced. Wheremultiple rebalancing triggers are used these will have an order definedby their respective predefined trigger lengths. Generally speaking: alower order rebalancing trigger will have a shorter predefined triggerlength and define a longer balancing process commencement delay; ahigher order rebalancing trigger will have a longer predefined triggerlength and define a shorter balancing process commencement delay. Thisallows for a balancing process to be commenced with less delay in theevent that congestion occurs faster than expected.

For example, a first rebalancing trigger may have a predefined triggerlength of three and define that on activation a balancing process is tobe commenced in 5 days. A second rebalancing trigger may have apredefined trigger length of five and define that on activation abalancing process is to be commenced in 12 hours.

As an alternative example, an issue ranking scheme may define a maximumallowed rank length of 253 characters. A first rebalancing trigger mayhave a predefined trigger length of 100 and define that on activation abalancing process is to be commenced in on the next weekend (i.e. atypically non-working day). A second rebalancing trigger may have apredefined trigger length of 200 and define that on activation abalancing process is to be commenced the next evening (again, selectinga time when system usage is likely to be reduced).

Additional rebalancing triggers could be defined. For example an nthrebalancing trigger could have a predefined trigger length ofx anddefine that a balancing operation is to commence on the next availableperiod of anticipated low ITS activity (e.g. that evening or the nextmorning). This may be achieved by reference to a system clock andknowledge of what are typically low activity times (e.g. after hours,weekends, public holidays etc.). Alternatively, the delay may be set at12 hours—the rationale being that a trigger is more likely to fire whenthe system is most busy and, accordingly, the system is likely to beless busy 12 hours from the trigger.

A final rebalancing trigger may also be defined to activate if anattempt to re-rank an issue fails due to congestion. This trigger maycause rebalancing to commence immediately as well as freeze all userinitiated rank operations for a period of time so resources caninitially be devoted to the rebalancing.

The systems and methods for triggering a balance process described inthis Section may be used to trigger a balancing process as described inSection 3 above. In this case an issue rank scheme defining rank valuesto have a balancing component and a normal component would be required.The systems and methods of this section may, however, also be used totrigger any alternative balancing process desired. In this case theissue rank scheme need not define rank values to have a balancingcomponent.

FIG. 9 illustrates a process 900 for triggering a balancing process.

At 902 a new issue rank value is calculated. This may be on creation ofan issue, reordering an issue, or balancing an issue. In one embodimentthe new issue rank is calculated in accordance with a rank operationprocesses as described in Section 3 above. Process 900 may be invoked onalternative calculations of new rank values.

At 904 the process determines whether or not the length of the new issuerank value is less than the predefined trigger length.

If the length of the new issue rank value is less than the predefinedtrigger length, the balance triggering process ends without arebalancing trigger having being activated.

At 906, if the length of the new issue rank value is greater than orequal to a predefined trigger length, a balance process is triggered. Asdiscussed above, the balance process may be triggered to commenceimmediately or following a delay.

In embodiments where multiple rebalancing triggers are defined anadditional determination is made at (or before) 906. In this case theprocess determines which of the multiple rebalancing triggers should beactivated and, accordingly, how the balance process should be triggered(e.g. so as to commence immediately or with a defined delay). For agiven activation, the relevant rebalancing trigger will be therebalancing trigger that has the longest predefined trigger length thatis less than or equal to the length of the new issue rank value.

By way of further example, FIG. 10 illustrates a process 1000 forcalculating new rank values and triggering a balance process. Process1000 is based on process 700 described above and retains the features ofprocess 700 (numbered with the same reference numerals for clarity).

In process 1000, after the new rank value has been determined at 710,the process determines whether or not the length of the new issue rankvalue is less than the predefined trigger length. This determination canbe made with reference to the value of the significant character indexi, which represents the length of the new issue rank.

If the length of the new issue rank is less than the predefined triggerlength (i<predefined trigger length), the rebalancing trigger is notactivated and the process ends.

At 1004, in response to determining that the length of the new issuerank value is greater than or equal to a predefined trigger length(i>=predefined trigger length), a balance process is triggered. Asdescribed in the above example, the balance process may be triggered tocommence immediately or following a delay.

In embodiments where multiple rebalancing triggers are defined anadditional determination is made at (or before) 1004 as to which of therebalancing triggers is to be activated. The rebalancing trigger to beactivated is determined to be the rebalancing trigger with the longestpredefined trigger length that is less than or equal to the length ofthe new issue rank (i.e. that is <=to i).

As can be seen, the rebalance triggering mechanism described aboveresult in balancing processes being automatically triggered. By basing arebalancing trigger on the length of newly calculated issue ranks,congestion is automatically detected as it occurs. There is no need torun dedicated periodic scans of the ITS to detect congestion.Furthermore, by setting an appropriate predefined trigger length abalancing process can be triggered to commence before congestion gets tothe point that rank operations fail. Still further, by using multiplerebalancing triggers attaching to progressively longer issue ranklengths, the possibility of congestion building rapidly is accounted forby allowing the importance of a balancing operation to be elevated (i.e.the delay in commencing a balancing operation decreased).

4.3 Worked Example

In order to further explain the rank operation process described abovethis section provides a worked example. The context of this workedexample is an issue rank scheme defining a maximum allowed rank lengthof six characters, each character capable of taking the value 0 to 9 orA to Z. This provides for issues with rank values ranging from: “000000”to “ZZZZZZ”. In this example the defined rebalancing trigger length isset to three.

For the purposes of this this example no balancing component of the rankvalue is included (or necessary). As will be appreciated from thedescription of Section 2, however, additional characters of greatersignificance could be added as a balancing component, or one or more ofthe most significant characters could be used as a balancing component,without affecting the methodology described in this Section.

In this example, as issues are created/added to the ITS 100 they areassigned initial rank values by performing a rank last operation asdescribed in Section 2 above. As more and more issues are added to theITS, and/or reordering operations in respect of the issues occur, thenew rank values being calculated in the ordering operations will startto have longer rank lengths. For example, Table 20 shows an example ofsix issues (four real issues, a minimum marker and a maximum marker)stored by an ITS:

TABLE 20 Issue_ID Issue_Rank 1 A 2 AB 3 AC 4 B 5 000000 6 ZZZZZZ

If a reorder operation is requested to order issue 4 after issue 1 (orbefore issue 2), the new rank value calculated in the reordering rankoperation may be “A6”. In this case it is determined (at 904 or 1002)that the new issue rank length (two) is less than the predefined triggerlength (three), and the rebalancing trigger is not activated. Table 21shows the result of such an operation:

TABLE 21 Issue_ID Issue_Rank 1 A 2 AB 3 AC 4 A6 5 000000 6 ZZZZZZ

If a reorder operation is the requested to order an issue after issue 2(or before issue 3), the new rank value calculated in the reorderingrank operation will need to have at least three significant characters.For example the new issue rank calculated may be “ABG”.

In this case it is determined (at 904 or 1002) that the new issue ranklength (three) is greater than or equal to the predefined trigger length(three). Accordingly, the rebalancing trigger is activated (at 906 or1004) and a balancing process is commenced or scheduled forcommencement.

In order to describe various features specific processes with specificoperations are described above—e.g. process 600, process 700, process800, process 900, and process 1000. These processes may be varied. Forexample: a given functional block may be implemented in an alternativeway to achieve the relevant result; a given functional block may besplit into multiple functional blocks to achieve the relevant result;one or more functional blocks may be combined into a single functionalblock to achieve the relevant result; the order in which the functionalblocks are performed may (in some cases) be varied.

4.4 Balance Triggering Embodiments

In one embodiment, this disclosure provides systems and methods fortriggering a balancing process for balancing issues stored by an ITS.The method comprises calculating a new rank value for an issue;determining whether a length of the new rank value is greater than orequal to a rebalancing trigger length; and in response to the length ofthe new rank value being greater than or equal to the rebalancingtrigger length, triggering an issue balancing process.

The length of a rank value may be the number of characters of the rankvalue.

Triggering a balancing process may comprise: delaying for a balancingprocess commencement delay period, the balancing process commencementdelay period being associated with the rebalancing trigger length; andfollowing the delay, commencing the issue balancing process.

A plurality of different balancing process commencement delay periodsmay be defined, each balancing process commencement delay period beingassociated with a different rebalancing trigger length.

A first rebalancing trigger length may be a shorter rebalancing triggerlength and a second rebalancing trigger may be a longer rebalancingtrigger length. A first balancing process commencement delay periodassociated with the first rebalancing trigger may be longer than asecond balancing process commencement delay associated with the secondbalancing trigger.

Once commenced, the balancing operation may be performed according toany of the balancing methods described in Section 3 above.

5. Hardware Overview

According to one embodiment, the techniques described herein areimplemented by one or more special-purpose computing devices. Thespecial-purpose computing devices may be hard-wired to perform thetechniques, or may include digital electronic devices such as one ormore application-specific integrated circuits (ASICs) or fieldprogrammable gate arrays (FPGAs) that are persistently programmed toperform the techniques, or may include one or more general purposehardware processors programmed to perform the techniques pursuant toprogram instructions in firmware, memory, other storage, or acombination. Such special-purpose computing devices may also combinecustom hard-wired logic, ASICs, or FPGAs with custom programming toaccomplish the techniques. The special-purpose computing devices may bedesktop computer systems, portable computer systems, handheld devices,networking devices or any other device that incorporates hard-wiredand/or program logic to implement the techniques.

For example, FIG. 11 is a block diagram that illustrates a computersystem 1100 upon which an embodiment of the invention may beimplemented. Computer system 1100 includes a bus 1102 or othercommunication mechanism for communicating information, and a hardwareprocessor 104 coupled with bus 1102 for processing information. Hardwareprocessor 1104 may be, for example, a general purpose microprocessor.

Computer system 1100 also includes a main memory 1106, such as a randomaccess memory (RAM) or other dynamic storage device, coupled to bus 1102for storing information and instructions to be executed by processor1104. Main memory 1106 also may be used for storing temporary variablesor other intermediate information during execution of instructions to beexecuted by processor 1104. Such instructions, when stored innon-transitory storage media accessible to processor 1104, rendercomputer system 1100 into a special-purpose machine that is customizedto perform the operations specified in the instructions.

Computer system 1100 further includes a read only memory (ROM) 1108 orother static storage device coupled to bus 1102 for storing staticinformation and instructions for processor 1104. A storage device 1110,such as a magnetic disk or optical disk, is provided and coupled to bus1102 for storing information and instructions.

Computer system 1100 may be coupled via bus 102 to one more outputdevices such as a display 112 for displaying information to a computeruser. Display 112 may, for example, be a cathode ray tube (CRT), aliquid crystal display (LCD), a light emitting diode (LED display), or atouch screen display. An input device 1114, including alphanumeric andother keys, may be coupled to bus 1102 for communicating information andcommand selections to processor 1104. Another type of user input deviceis cursor control 1116, such as a mouse, a trackball, or cursordirection keys for communicating direction information and commandselections to processor 1104 and for controlling cursor movement ondisplay 1112. This input device typically has two degrees of freedom intwo axes, a first axis (e.g., x) and a second axis (e.g., y), thatallows the device to specify positions in a plane. Additional and/oralternative input devices are possible, for example touch screendisplays.

Computer system 1100 may implement the techniques described herein usingcustomized hard-wired logic, one or more ASICs or FPGAs, firmware and/orprogram logic which in combination with the computer system causes orprograms computer system 1100 to be a special-purpose machine. Accordingto one embodiment, the techniques herein are performed by computersystem 1100 in response to processor 1104 executing one or moresequences of one or more instructions contained in main memory 106. Suchinstructions may be read into main memory 106 from another storagemedium, such as storage device 1110. Execution of the sequences ofinstructions contained in main memory 1106 causes processor 1104 toperform the process steps described herein. In alternative embodiments,hard-wired circuitry may be used in place of or in combination withsoftware instructions.

The term “storage media” as used herein refers to any non-transitorymedia that store data and/or instructions that cause a machine tooperation in a specific fashion. Such storage media may comprisenon-volatile media and/or volatile media. Non-volatile media includes,for example, optical or magnetic disks, such as storage device 1110.Volatile media includes dynamic memory, such as main memory 1106. Commonforms of storage media include, for example, a floppy disk, a flexibledisk, hard disk, solid state drive, magnetic tape, or any other magneticdata storage medium, a CD-ROM, any other optical data storage medium,any physical medium with patterns of holes, a RAM, a PROM, and EPROM, aFLASH-EPROM, NVRAM, any other memory chip or cartridge.

Storage media is distinct from but may be used in conjunction withtransmission media. Transmission media participates in transferringinformation between storage media. For example, transmission mediaincludes coaxial cables, copper wire and fiber optics, including thewires that comprise bus 1102. Transmission media can also take the formof acoustic or light waves, such as those generated during radio-waveand infra-red data communications.

Various forms of media may be involved in carrying one or more sequencesof one or more instructions to processor 1104 for execution. Forexample, the instructions may initially be carried on a magnetic disk orsolid state drive of a remote computer. The remote computer can load theinstructions into its dynamic memory and send the instructions over atelephone line using a modem. A modem local to computer system 1100 canreceive the data on the telephone line and use an infra-red transmitterto convert the data to an infra-red signal. An infra-red detector canreceive the data carried in the infra-red signal and appropriatecircuitry can place the data on bus 1102. Bus 1102 carries the data tomain memory 1106, from which processor 1104 retrieves and executes theinstructions. The instructions received by main memory 1106 mayoptionally be stored on storage device 1110 either before or afterexecution by processor 1104.

Computer system 1100 also includes a communication interface 1118coupled to bus 1102. Communication interface 1118 provides a two-waydata communication coupling to a network link 1120 that is connected toa local network 1122. For example, communication interface 1118 may bean integrated services digital network (ISDN) card, cable modem,satellite modem, or a modem to provide a data communication connectionto a corresponding type of telephone line. As another example,communication interface 1118 may be a local area network (LAN) card toprovide a data communication connection to a compatible LAN. Wirelesslinks may also be implemented. In any such implementation, communicationinterface 1118 sends and receives electrical, electromagnetic or opticalsignals that carry digital data streams representing various types ofinformation.

Network link 1120 typically provides data communication through one ormore networks to other data devices. For example, network link 1120 mayprovide a connection through local network 1122 to a host computer 1124or to data equipment operated by an Internet Service Provider (ISP)1126. ISP 1126 in turn provides data communication services through theworld wide packet data communication network now commonly referred to asthe “Internet” 1128. Local network 1122 and Internet 1128 both useelectrical, electromagnetic or optical signals that carry digital datastreams. The signals through the various networks and the signals onnetwork link 1120 and through communication interface 1118, which carrythe digital data to and from computer system 1100, are example forms oftransmission media.

Computer system 1100 can send messages and receive data, includingprogram code, through the network(s), network link 1120 andcommunication interface 1118. In the Internet example, a server 1130might transmit a requested code for an application program throughInternet 1128, ISP 1126, local network 1122 and communication interface1118.

The received code may be executed by processor 1104 as it is received,and/or stored in storage device 1110, or other non-volatile storage forlater execution.

A computer system as described herein may be configured in a pluralityof useful arrangements. In one approach, a data processing methodcomprises using a server computer, obtaining from one or morenon-transitory computer-readable data storage media a copy of one ormore sequences of instructions that are stored on the media and whichwhen executed using a particular user computer among a plurality of usercomputers cause the particular user computer to perform, using theparticular user computer alone or in combination with the servercomputer, the techniques that are described herein; and using the servercomputer, downloading the copy of the one or more sequences ofinstructions to any user computer among the plurality of user computers.

In another approach, a computer system comprises a server computercomprising one or more non-transitory computer-readable data storagemedia stored with one or more sequences of instructions which whenexecuted using a particular user computer among a plurality of usercomputers cause the particular user computer to perform: using theparticular user computer, alone or in combination with the servercomputer, the techniques that are described herein; and in the servercomputer, stored downloading instructions which, when executed using theserver computer, cause downloading a plurality of copies of the one ormore sequences of instructions to the plurality of user computers.

A computer system may take a variety of forms. For example user computer112 may be a desktop computer, a laptop computer, a notebook computer, atablet computer, a smart phone, or other another computer.

In the foregoing specification, embodiments of the invention have beendescribed with reference to numerous specific details that may vary fromimplementation to implementation. Thus, the sole and exclusive indicatorof what is the invention, and is intended by the applicants to be theinvention, is the set of claims that issue from this application, in thespecific form in which such claims issue, including any subsequentcorrection. Any definitions expressly set forth herein for termscontained in such claims shall govern the meaning of such terms as usedin the claims. Hence, no limitation, element, property, feature,advantage or attribute that is not expressly recited in a claim shouldlimit the scope of such claim in any way. The specification and drawingsare, accordingly, to be regarded in an illustrative rather than arestrictive sense.

As used herein the terms “include” and “comprise” (and variations ofthose terms, such as “including”, “includes”, “comprising”, “comprises”,“comprised” and the like) are intended to be inclusive and are notintended to exclude further features, components, integers or steps.

It will be understood that the embodiments disclosed and defined in thisspecification extends to all alternative combinations of two or more ofthe individual features mentioned or evident from the text or drawings.All of these different combinations constitute various alternativeaspects of the embodiments.

What is claimed is:
 1. A computer-implemented method of triggering an issue balancing process, comprising: calculating, by a processor, a first new rank value in a rank address space for a first issue of a plurality of issues, the rank address space comprising unique, ordered values, each of the plurality of issues having a rank value in the rank address space; determining, by the processor, whether a length of the first new rank value is greater than or equal to a first rebalancing trigger length; in response to determining that the length of the first new rank value is greater than or equal to the first rebalancing trigger length, identifying a first delay period that is to elapse before rebalancing the rank address space comprising updating at least one rank value of at least one of the plurality of issues to reduce a possibility of congestion in the rank address space; following the first delay period, rebalancing the rank address space.
 2. The computer-implemented method of claim 1, further comprising defining a plurality of rebalancing trigger lengths, including the first rebalancing trigger length and a second rebalancing trigger length, and an associated plurality of delay periods, including the first delay period and a second delay period.
 3. The computer-implemented method of claim 2, the first rebalancing trigger length being shorter than the second rebalancing trigger length, the first delay period being longer than the second delay period.
 4. The computer-implemented method of claim 2, the first rebalancing trigger length being a longest trigger length among the plurality of rebalancing trigger lengths that is less than or equal to the length of the first new rank value.
 5. The computer-implemented method of claim 1, further comprising: subsequent to the rebalancing, calculating a second new rank value in a rank address space for a second issue, determining whether a length of the second new rank value is greater than or equal to a second rebalancing trigger length, the second rebalancing trigger length being longer than the first rebalancing trigger length; in response to determining that the length of the second new rank value is greater than or equal to the second rebalancing trigger length, identifying a second delay period that is to elapse before further rebalancing the rank address space, the second delay period being shorter than the first delay period.
 6. The computer-implemented method of claim 1, the first delay period being defined to cause the balancing to commence at a low activity time of the processor.
 7. The computer-implemented method of claim 1, further comprising: determining that an attempt to re-rank a second issue of the plurality of issues has failed due to congestion of the rank address space; rebalancing the issue address space without a delay.
 8. The computer-implemented method of claim 7, further comprising freezing user-initiated issue ranking operations for a certain amount of time.
 9. The computer-implemented method of claim 1, the rank value of each of the plurality of issues comprising a balancing component and a normal component, the balancing component identifying a current issue bucket of a plurality of issue buckets within the issue address space, the normal component comprising one or more characters.
 10. The computer-implemented method of claim 9, the updating comprising changing the balancing component of the rank value of a certain issue of the at least one issue without affecting a relative order of rank values of the plurality of issues.
 11. One or more non-transitory storage media storing instructions which, when executed cause one or more processors to perform a method of triggering an issue balancing process, the method comprising: calculating a first new rank value in a rank address space for a first issue of a plurality of issues, the rank address space comprising unique, ordered values, each of the plurality of issues having a rank value in the rank address space; determining whether a length of the first new rank value is greater than or equal to a first rebalancing trigger length; in response to determining that the length of the first new rank value is greater than or equal to the first rebalancing trigger length, identifying a first delay period that is to elapse before rebalancing the rank address space comprising updating at least one rank value of at least one of the plurality of issues to reduce a possibility of congestion in the rank address space; following the first delay period, rebalancing the rank address space.
 12. The one or more non-transitory storage media of claim 11, the method further comprising defining a plurality of rebalancing trigger lengths, including the first rebalancing trigger length and a second rebalancing trigger length, and an associated plurality of delay periods, including the first delay period and a second delay period.
 13. The one or more non-transitory storage media of claim 12, the first rebalancing trigger length being shorter than the second rebalancing trigger length, the first delay period being longer than the second delay period.
 14. The one or more non-transitory storage media of claim 12, the first rebalancing trigger length being a longest trigger length among the plurality of rebalancing trigger lengths that is less than or equal to the length of the first new rank value.
 15. The one or more non-transitory storage media of claim 11, the method further comprising: subsequent to the rebalancing, calculating a second new rank value in a rank address space for a second issue, determining whether a length of the second new rank value is greater than or equal to a second rebalancing trigger length, the second rebalancing trigger length being longer than the first rebalancing trigger length; in response to determining that the length of the second new rank value is greater than or equal to the second rebalancing trigger length, identifying a second delay period that is to elapse before further rebalancing the rank address space, the second delay period being shorter than the first delay period.
 16. The one or more non-transitory storage media of claim 11, the first delay period being defined to cause the balancing to commence at a low activity time of the processor.
 17. The one or more non-transitory storage media of claim 11, the method further comprising: determining that an attempt to re-rank a second issue of the plurality of issues has failed due to congestion of the rank address space; rebalancing the issue address space without a delay.
 18. The one or more non-transitory storage media of claim 17, the method further comprising freezing user-initiated issue ranking operations for a certain amount of time.
 19. The one or more non-transitory storage media of claim 11, the rank value of each of the plurality of issues comprising a balancing component and a normal component, the balancing component identifying a current issue bucket of a plurality of issue buckets within the issue address space, the normal component comprising one or more characters.
 20. The one or more non-transitory storage media of claim 19, the updating comprising changing the balancing component of the rank value of a certain issue of the at least one issue without affecting a relative order of rank values of the plurality of issues. 